In this paper, we consider the edge fault tolerance of n-dimensional burnt pancake graph BPn such that each vertex is incident with at least two fault free edges. Based on this requirement, we show that BPn contains a fault free Hamilton cycle even it has up to 2n-5 link faults, where n≥3. © 2013 Elsevier B.V. All rights reserved.
CITATION STYLE
Hu, X., Liu, H., & Pan, X. F. (2014). Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults. Discrete Applied Mathematics, 169, 152–161. https://doi.org/10.1016/j.dam.2013.12.025
Mendeley helps you to discover research relevant for your work.