By Topic

Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chun-Nan Hung ; Dept. of Comput. Sci. & Inf. Eng., Da-Yet Univ., Changhua, Taiwan ; Kao-Yung Liang ; Lih-Hsing Hsu

The use of pancake and star networks as an interconnection network has been studied by many researchers. The fault tolerance for Hamiltonian networks is also an important issue. In this paper, we prove that an n-dimensional faulty pancake graph contains a Hamiltonian cycle with |F| ⩽ n - 3 faults. Furthermore, there exist Hamiltonian paths between two arbitrary but distinct nodes in a faulty pancake graph with |F| ⩽ n - 4 faults

Published in:

Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on

Date of Conference: