Hyper hamiltonian laceability on edge fault star graph

  • Authors:

  • Tseng-Kuei Li;Jimmy J. M. Tan;Lih-Hsing Hsu

  • Affiliations:

  • Department of Computer Science and Information Engineering, Ching Yun University, JungLi 320, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2004

Quantified Score

Hi-index 0.08

Visualization

Abstract

The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n - 3)-edge fault tolerant hamiltonian laceable, (n - 3)-edge fault tolerant strongly hamiltonian laceable, and (n - 4)- edge fault tolerant hyper hamiltonian laceable. All these results are optimal in a sense described in this paper.