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...
Saved in:
Main Authors: | Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila |
---|---|
Format: | Article |
Language: | English |
Published: |
CESER Publications
2015
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Complete graph K4 decomposition into circuits of length 4
by: Mohd Darus, Maizon, et al.
Published: (2014) -
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
by: Maizon, Mohd Darus
Published: (2015) -
Some New Theoretical Work On Half Butterfly Method For
Hamiltonian Circuit In Complete Graph
by: Maizon, Mohd Darus, et al.
Published: (2017) -
Some New Theoretical Work on Half Butterfly Method for
Hamiltonian Circuit in Complete Graph
by: Mohd Darus,, Maizon, et al.
Published: (2017) -
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
by: Karim, Sharmila, et al.
Published: (2019)