Ring embedding in faulty pancake graphs

Authors:
Chun-Nan Hung;Hong-Chun Hsu;Kao-Yung Liang;Lih-Hsing Hsu
Affiliations:
Department of Computer Science and Information Engineering, Da-Yet University, Changhua 51505, Taiwan, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, Da-Yet University, Changhua 51505, Taiwan, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, R.O.C.
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 5

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks

Information Processing Letters
On the embedding of cycles in pancake graphs

Parallel Computing
On the diameter of the pancake network

Journal of Algorithms
On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

Information Sciences—Informatics and Computer Science: An International Journal
Fault-tolerant Hamiltonicity of twisted cubes

Journal of Parallel and Distributed Computing
Graph Theory With Applications

Graph Theory With Applications

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

Information Processing Letters
The super connectivity of the pancake graphs and the super laceability of the star graphs

Theoretical Computer Science
A parallel algorithm for interpolation in pancake graph

SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

International Journal of Computer Mathematics
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider the fault Hamiltonicity and the fault Hamiltonian connectivity of the pancake graph Pn. Assume that F ⊆ V (Pn) ∪ E (Pn). For n ≥ 4, we prove that Pn - F is Hamiltonian if |F|≤(n - 3) and Pn - F is Hamiltonian connected if |F|≤(n - 4). Moreover, all the bounds are optimal.