Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
In this paper, we formulate the existence of cyclic near-Hamiltonian cycle decomposition of 2Kv, for each odd v > 3. Moreover, a graphical representation for constructing a base cycle for such cyclic near-Hamiltonian cycle decomposition is presented. Then, some examples of this construction for t...
Saved in:
Main Authors: | Aldiabat, Raja’i, Ibrahim, Haslinda, Karim, Sharmila |
---|---|
Format: | Article |
Published: |
AIP Publishing LLC
2019
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/26921/ http://doi.org/10.1063/1.5121042 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Cyclic Near-Hamiltonian Cycle System of the Complete
Multigraph
by: Aldiabat, Raja'i, et al.
Published: (2017) -
On the existence of a cyclic near-Rrsolvable (6n+4)-cycle system of 2K12n+9
by: Aldiabat, Raja'i, et al.
Published: (2019) -
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
by: Karim, Sharmila, et al.
Published: (2019) -
On the Existence of a Cyclic Near-Resolvable (6n + 4)-Cycle
System of 2k12n+9
by: Aldiabat, Raja’i, et al.
Published: (2019) -
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
by: Maizon, Mohd Darus
Published: (2015)