Cover Image

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

Saved in:
Bibliographic Details
Main Authors: Aldiabat, Raja’i, Ibrahim, Haslinda, Karim, Sharmila
Format: Article
Published: AIP Publishing LLC 2019
Subjects:
QA75 Electronic computers. Computer science
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!
id my.uum.repo.26921
record_format eprints
spelling my.uum.repo.269212020-03-18T04:26:08Z http://repo.uum.edu.my/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
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutional Repository
url_provider http://repo.uum.edu.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
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.
format Article
author Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
author_facet Aldiabat, Raja’i
Ibrahim, Haslinda
Karim, Sharmila
author_sort Aldiabat, Raja’i
title Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
title_short 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_sort cyclic near-hamiltonian cycle decomposition of 2-fold complete graph
publisher AIP Publishing LLC
publishDate 2019
url http://repo.uum.edu.my/26921/
http://doi.org/10.1063/1.5121042
_version_ 1662757795182673920
score 13.211869

Similar Items