Tsai, Ping-YingPing-YingTsaiFu, Jung-ShengJung-ShengFuChen, Gen-HueyGen-HueyChen2009-04-292018-07-052009-04-292018-07-052008https://www.scopus.com/inward/record.uri?eid=2-s2.0-55949099319&doi=10.1016%2fj.tcs.2008.09.015&partnerID=40&md5=18abcde82fe550794698efb33d8a6362The conditional fault model imposes a constraint on the fault distribution. For example, the most commonly imposed constraint for edge faults is that each vertex is incident with two or more non-faulty edges. In this paper, subject to this constraint, we show that an n-dimensional pancake graph can tolerate up to 2 n - 7 edge faults, while retaining a fault-free Hamiltonian cycle, where n ≥ 4. Previously, at most n - 3 edge faults can be tolerated for the same problem, if the edge faults may occur anywhere without imposing any constraint. © 2008 Elsevier B.V. All rights reserved.application/pdf1519235 bytesapplication/pdfen-USCayley graph; Conditional fault model; Fault tolerance; Hamiltonian cycle; Pancake graphGraph theory; Hamiltonians; Meats; Quality assurance; Reliability; Cayley graph; Conditional fault model; Edge faults; Fault distributions; Fault models; Fault-tolerant; Faulty edges; Hamiltonian cycle; Hamiltonian cycles; Hamiltonicity; Pancake graph; Pancake graphs; Fault tolerancejournal article10.1016/j.tcs.2008.09.0152-s2.0-55949099319http://ntur.lib.ntu.edu.tw/bitstream/246246/154733/1/49.pdf