Conditional Fault Hamiltonicity of the Star Graph

Cheng-Kuan Lin, Jiann-Mean Tan, Lih Hsing Hsu*, Eddie Cheng, Liptak Laszlo

*Corresponding author for this work

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Fault tolerance is an important property on network performance. A graph G is k-edge-fault conditional hamiltonian if G - F is hamiltonian for every F subset of E(G) with vertical bar F vertical bar <= k and delta(G - F) >= 2. In this paper we show that for n >= 4 the n-dimensional star graph S-n is (3n - 10)-edge-fault conditional hamiltonian.
Original languageEnglish
Pages (from-to)111-127
JournalArs Combinatoria
Volume113
StatePublished - Jan 2014

Keywords

  • hamiltonian; star graphs; fault-tolerant

Fingerprint Dive into the research topics of 'Conditional Fault Hamiltonicity of the Star Graph'. Together they form a unique fingerprint.

  • Cite this

    Lin, C-K., Tan, J-M., Hsu, L. H., Cheng, E., & Laszlo, L. (2014). Conditional Fault Hamiltonicity of the Star Graph. Ars Combinatoria, 113, 111-127.