Conditional Fault Hamiltonicity of the Star Graph

Cheng-Kuan Lin1, Jimmy J. M. Tan1, Lih-Hsing Hsu2, Eddie Cheng3, Laszlo Liptak3
1Department of Computer Science, National Chiao Tung University
2Department of Computer Science and Information Engineering, Providence University
3Department of Mathematics and Statistics, Oakland University

Abstract

Fault tolerance is an important property of network performance. A graph \(G\) is \(k\)-edge-fault conditional Hamiltonian if \(G – F\) is Hamiltonian for every \(F \subset E(G)\) with \(|F| \leq k\) and \(\delta(G – F) \geq 2\). In this paper, we show that for \(n \geq 4\), the \(n\)-dimensional star graph \(S_n\) is \((3n – 10)\)-edge-fault conditional Hamiltonian.