Balanced C_4-Bowtie Decomposition of Complete Multi-Graphs(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We show that the necessary and sufficient condition for the existence of a balanced C_4-bowtie decomposition of the complete multigraph λK_n is λ(n-1)≡0(mod 16) and n≥7. Decomposition algorithms are also given.
- 社団法人電子情報通信学会の論文
- 2005-05-01
著者
-
Ushio Kazuhiko
Kinki Univ. Higashiosaka‐shi Jpn
-
Ushio Kazuhiko
Faculty Of Science And Technology Kinki University
-
FUJIMOTO Hideaki
Faculty of Science and Technology, Kinki University
-
Fujimoto Hideaki
Faculty Of Science And Technology Kinki University
-
Fujimoto Hideaki
Kinki Univ. Higashiosaka‐shi Jpn
関連論文
- 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)
- A-1-7 Balanced trefoil decomposition algorithm of complete graphs
- A-1-6 Balanced bowtie decomposition algorithm of complete graphs
- Reverse process of coprecipitation of dissolved organic carbon with Fe(III) precipitates in a lake
- A Dual-Band Comb-Line Filter Using a Half-Wavelength Stripline Nesting a Quarter-Wavelength Coplanar Waveguide Resonator(Electromagnetics,2006 International Symposium on Antennas and Propagation)
- 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)