The construction of distinct circuits of length six for complete graph K6
The emergent applications of complete graph in diverse domains have invited numerous works in this subject matter.Studies related to the decomposition of complete graph such as one-factor, several ɳ-gons and Cartesian product have been solved.Yet, the decomposition of complete graph into distinct ci...
保存先:
主要な著者: | Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila |
---|---|
フォーマット: | 論文 |
言語: | English |
出版事項: |
CESER Publications
2015
|
主題: | |
オンライン・アクセス: | http://repo.uum.edu.my/15049/1/The%20Cons.pdf http://repo.uum.edu.my/15049/ http://www.ceser.in/ceserp/index.php/ijamas/index |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Complete graph K4 decomposition into circuits of length 4
著者:: Mohd Darus, Maizon, 等
出版事項: (2014) -
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
著者:: Maizon, Mohd Darus
出版事項: (2015) -
Some New Theoretical Work On Half Butterfly Method For
Hamiltonian Circuit In Complete Graph
著者:: Maizon, Mohd Darus, 等
出版事項: (2017) -
Some New Theoretical Work on Half Butterfly Method for
Hamiltonian Circuit in Complete Graph
著者:: Mohd Darus,, Maizon, 等
出版事項: (2017) -
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
著者:: Karim, Sharmila, 等
出版事項: (2019)