In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph Moreover, all the bounds are optimal.
โฆ LIBER โฆ
Ring embedding in faulty honeycomb rectangular torus
โ Scribed by Hsun-Jung Cho; Li-Yen Hsu
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 127 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
Assume that m and n are positive even integers with n 4. The honeycomb rectangular torus HReT(m, n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We prove that any HReT(m, n)e is hamiltonian for any edge e โ E(HReT(m, n)). Moreover, any HReT(m, n) -F is hamiltonian for any F = {a, b} with a โ A and b โ B where A and B are the bipartition of HReT(m, n), if n 6 or m = 2.
๐ SIMILAR VOLUMES
Ring embedding in faulty pancake graphs
โ
Chun-Nan Hung; Hong-Chun Hsu; Kao-Yung Liang; Lih-Hsing Hsu
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 192 KB
Embedding a ring in a hypercube with bot
โ
Yu-Chee Tseng
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 498 KB
Embedding a fault-free hamiltonian cycle
โ
Qiang Dong; Xiaofan Yang; Juan Zhao
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 415 KB