Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle

Hongwei Qiao, Jixiang Meng and Eminjan Sabir

Applied Mathematics and Computation, 2022, vol. 435, issue C

Abstract: Embedding cycles into a network topology is crucial for the network simulation. In particular, embedding Hamiltonian cycles is a major requirement for designing good interconnection networks. A graph G is called k-spanning cyclable if, for any k distinct vertices v1,v2,…,vk of G, there exist k cycles C1,C2,…,Ck in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci. If k=1, this is the classical Hamiltonian problem. In this study, we focus on embedding spanning disjoint cycles in enhanced hypercube networks and show that the n-dimensional enhanced hypercube Qn,m is k-spanning cyclable if k≤n and n≥4, and k-spanning cyclable if k≤n−1 and n=2,3. Moreover, the results are optimal with respect to the degree of Qn,m, and some experimental examples are provided to verify the theoretical results.

Keywords: Enhanced Hypercubes; Spanning cyclable; Hamiltonian cycles; Disjoint cycles (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322005550
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:435:y:2022:i:c:s0096300322005550

DOI: 10.1016/j.amc.2022.127481

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().