Balanced Bowtie Decomposition of Symmetric Complete Multi-digraphs(Graphs and Networks)
スポンサーリンク
概要
- 論文の詳細を見る
We show that the necessary and sufficient condition for the existence of a balanced bowtie decomposition of the symmetric complete multi-digraph λK^*_n ≥ 5 and λ(n - 1) = 0 (mod 6). Decomposition algorithms are also given.
- 社団法人電子情報通信学会の論文
- 2004-10-01
著者
-
Ushio Kazuhiko
Faculty Of Science And Technology Kinki University
-
Fujimoto Hideaki
Faculty Of Science And Technology Kinki University
関連論文
- Balanced C_4-Trefoil Decomposition of Complete Multi-Graphs(Discrete Mathematics and Its Applications)
- Balanced C_4-Bowtie Decomposition of Complete Multi-Graphs(Discrete Mathematics and Its Applications)
- Reverse process of coprecipitation of dissolved organic carbon with Fe(III) precipitates in a lake
- Balanced Bowtie Decomposition of Complete Multigraphs(Graphs and Networks)
- Balanced Bowtie Decomposition of Symmetric Complete Multi-digraphs(Graphs and Networks)
- Balanced Bowtie and Trefoil Decomposition of Complete Tripartite Multigraphs(Graphs and Networks)(Regular Section)