Premium
Some edge‐fault‐tolerant properties of the folded hypercube
Author(s) -
Hsieh SunYuan
Publication year - 2008
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20204
Subject(s) - hypercube , fault tolerance , hamiltonian (control theory) , enhanced data rates for gsm evolution , combinatorics , hamiltonian path , mathematics , computer science , discrete mathematics , distributed computing , mathematical optimization , graph , telecommunications
In this article, we analyze some edge‐fault‐tolerant properties of the folded hypercube, a variant of the regular hypercube that is obtained by adding an edge to every pair of nodes with complementary addresses. We show that an n ‐dimensional folded hypercube is ( n − 2)‐edge‐fault‐tolerant Hamiltonian‐connected when n (≥ 2) is even, ( n − 1)‐edge‐fault‐tolerant strongly Hamiltonian‐laceable when n (≥ 1) is odd, and ( n − 2)‐edge‐fault‐tolerant hyper Hamiltonian‐laceable when n (≥ 3) is odd. © 2007 Wiley Periodicals, Inc. NETWORKS, 2008
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom