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...
Main Authors: | Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila |
---|---|
Format: | Article |
Language: | English |
Published: |
CESER Publications
2015
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/15049/1/The%20Cons.pdf |
Similar Items
-
Complete graph K4 decomposition into circuits of length 4
by: Mohd Darus, Maizon, et al.
Published: (2014) -
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) -
Butterfly Triple System Algorithm Based on Graph Theory
by: Ibrahim, Haslinda, et al.
Published: (2022)