Hamiltonian cycles of balanced hypercube with disjoint faulty edges
Authors: 
Ting Lan, Huazhong LüAuthors Info & Claims
Ting Lan, Huazhong LüAuthors Info & ClaimsReferences
[1]
D. Cheng, R. Hao, Y. Feng, Vertex-fault-tolerant cycles embedding in balanced hypercubes, Inf. Sci. 288 (2014) 449–461.
[2]
J. Fan, X. Lin, X. Jia, Optimal path embeddings of paths with various lengths in twisted cubes, IEEE Trans. Parallel Distrib. Syst. 18 (4) (2007) 511–521.
[3]
R. Hao, R. Zhang, Y. Feng, J. Zhou, Hamiltonian cycle embedding for fault tolerance in balanced hypercubes, Appl. Math. Comput. 244 (2014) 447–456.
[4]
S.-Y. Hsieh, G.H. Chen, C.W. Ho, Hamiltonian-laceability of star graphs, Networks 36 (2000) 225–232.
[5]
S.-Y. Hsieh, Y.-R. Cian, Conditional edge-fault Hamiltonicity of augmented cubes, Inf. Sci. 180 (13) (2010) 2596–2617.
[6]
F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, Calif, San Mateo, 1992.
[7]
P. Li, M. Xu, Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes, Appl. Math. Comput. 307 (2017) 180–192.
[8]
P. Li, M. Xu, Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults, Int. J. Found. Comput. Sci. 30 (5) (2019) 693–717.
[9]
H. Lü, On extra connectivity and extra edge-connectivity of balanced hypercubes, Int. J. Comput. Math. 94 (2017) 813–820.
[10]
H. Lü, Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges, J. Supercomput. 75 (2019) 400–424.
[11]
H. Lü, X. Li, H. Zhang, Matching preclusion for balanced hypercubes, Theor. Comput. Sci. 465 (2012) 10–20.
[12]
T. Lan, H. Lü, Hamiltonian cycles of balanced hypercube with more faulty edges, Theor. Comput. Sci. 947 (2023).
[13]
J.-H. Park, Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs, Theor. Comput. Sci. 617 (2016) 45–64.
[14]
C.H. Tsai, J.J.M. Tan, T. Liang, L.H. Hsu, Fault-tolerant Hamiltonian laceability of hypercubes, Inf. Process. Lett. 83 (2002) 301–306.
[15]
J. Wu, K. Huang, The balanced hypercube: a cube-based system for fault-tolerant applications, IEEE Trans. Comput. 46 (4) (1997) 484–490.
[16]
J. Wu, K. Huang, Area efficient layout of balanced hypercubes, Int. J. High Speed Electron. Syst. 6 (4) (1995) 631–646.
[17]
D. Dimitrov, T. Dvořák, P. Gregor, R. Škrekovski, Gray codes avoiding matchings, Discrete Math. Theor. Comput. Sci. 11 (2009) 123–148.
[18]
M. Xu, H. Hu, J. Xu, Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes, Appl. Math. Comput. 189 (2007) 1393–1401.
[19]
D.-W. Yang, Y.-Q. Feng, J. Lee, J.-X. Zhou, On extra connectivity and extra edge-connectivity of balanced hypercubes, Appl. Math. Comput. 320 (2018) 464–473.
[20]
M. Yang, Bipanconnectivity of balanced hypercubes, Comput. Math. Appl. 60 (2010) 1859–1867.
[21]
M. Yang, Conditional diagnosability of balanced hypercubes under the PMC model, Inf. Sci. 222 (2013) 754–760.
[22]
M. Yang, Super connectivity of balanced hypercubes, Appl. Math. Comput. 219 (2012) 970–975.
[23]
J. Zhou, Z. Wu, S. Yang, K. Yuan, Symmetric property and reliability of balanced hypercube, IEEE Trans. Comput. 64 (3) (2015) 876–881.
[24]
Q. Zhou, C. Chen, H. Lü, Fault-tolerant Hamiltonian laceability of balanced hypercubes, Inf. Sci. 300 (2015) 20–27.
[25]
A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Syst. 2 (1) (1991) 31–42.
[26]
Kemal Efe, The crossed cube architecture for parallel computation, IEEE Trans. Parallel Distrib. Syst. 3 (5) (1992) 513–524.
[27]
P.A.J. Hilbers, M.R.J. Koopman, J.D.V. Snepscheut, The twisted cube, in: Parallel Architectures and Languages Europe. I, Parallel Architectures, Eindhoven, The Netherlands, June 1987, pp. 15–19.
Index Terms
- Hamiltonian cycles of balanced hypercube with disjoint faulty edges
Index terms have been assigned to the content through auto-classification.
Recommendations
Hamiltonian cycles of balanced hypercube with more faulty edges
AbstractThe balanced hypercube B H n, a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most 4 n − 5 faulty edges if each ...
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Highlights- We consider Hamiltonian cycles in hypercubes Q n with n ≥ 4 and disjoint faulty edges.
AbstractWe consider hypercubes with pairwise disjoint faulty edges. An n-dimensional hypercube Q n is an undirected graph with 2 n nodes, each labeled with a distinct binary string of length n. The parity of the vertex is 0 if the number of ...
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
AbstractThe n-dimensional balanced hypercube B H n (n ≥ 1) has been proved to be a bipartite graph. Let P be a set of edges in B H n. For any two vertices u , v from different partite sets of V ( B H n ). In this paper, we prove that if | P | ≤...
Comments
Information & Contributors
Information
Published In
Elsevier B.V.
Publisher
Elsevier North-Holland, Inc.
United States
Publication History
Published: 18 October 2024
Author Tags
Qualifiers
- Rapid-communication
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Dec 2024