Affiliation:
1. Department of Mathematics, Jinan University, Guangzhou 510632, P. R. China
Abstract
Let [Formula: see text] be a set of edges whose induced subgraph consists of vertex-disjoint paths in an [Formula: see text]-dimensional locally twisted cube [Formula: see text]. In this paper, we prove that if [Formula: see text] contains at most [Formula: see text] edges, then [Formula: see text] contains a Hamiltonian cycle passing through every edge of [Formula: see text], where [Formula: see text]. [Formula: see text] has a Hamiltonian cycle passing through at most one prescribed edge.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Networks and Communications
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving Time Efficiency of a Hierarchical Metaheuristic for the Euclidean TSP using Crossed Cubes Interconnection Networks;Proceedings of the 2023 6th International Conference on E-Business, Information Management and Computer Science;2023-12-30
2. The generalized 4-connectivity of locally twisted cubes;Journal of Applied Mathematics and Computing;2023-05-21
3. Construction Compressed Quadtree into M-Dimensional Crossed Cubes via the Embedding;2022 International Symposium on iNnovative Informatics of Biskra (ISNIB);2022-12-07