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...

Full description

Bibliographic Details
Main Authors: Aldiabat, Raja’i, Ibrahim, Haslinda, Karim, Sharmila
Format: Article
Published: AIP Publishing LLC 2019
Subjects:
_version_ 1825805560157569024
author Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
author_facet Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
author_sort Aldiabat, Raja’i
collection UUM
description 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 the cases v = 9 and v = 15 are discussed in detail.
first_indexed 2024-07-04T06:34:18Z
format Article
id uum-26921
institution Universiti Utara Malaysia
last_indexed 2024-07-04T06:34:18Z
publishDate 2019
publisher AIP Publishing LLC
record_format eprints
spelling uum-269212020-03-18T04:26:08Z https://repo.uum.edu.my/id/eprint/26921/ Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph Aldiabat, Raja’i Ibrahim, Haslinda Karim, Sharmila QA75 Electronic computers. Computer science 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 the cases v = 9 and v = 15 are discussed in detail. AIP Publishing LLC 2019 Article PeerReviewed Aldiabat, Raja’i and Ibrahim, Haslinda and Karim, Sharmila (2019) Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph. AIP Conference Proceedings, 2138. 030005. ISSN 0094-243X http://doi.org/10.1063/1.5121042 doi:10.1063/1.5121042 doi:10.1063/1.5121042
spellingShingle QA75 Electronic computers. Computer science
Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_full Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_fullStr Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_full_unstemmed Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_short Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_sort cyclic near hamiltonian cycle decomposition of 2 fold complete graph
topic QA75 Electronic computers. Computer science
work_keys_str_mv AT aldiabatrajai cyclicnearhamiltoniancycledecompositionof2foldcompletegraph
AT ibrahimhaslinda cyclicnearhamiltoniancycledecompositionof2foldcompletegraph
AT karimsharmila cyclicnearhamiltoniancycledecompositionof2foldcompletegraph