2000 character limit reached
Hamiltonian Properties of Hybrid-Faulty Burnt Pancake Graphs
Published 23 Dec 2024 in math.CO | (2412.17236v1)
Abstract: We investigate the combined occurrence of edge faults and vertex faults in the burnt pancake graph (( BP_n )). In this paper, we prove that ( BP_n - F ), where ( F ) includes pairs of end-vertices of matching edges and fault-tolerant edges, contains a Hamiltonian cycle when ( |F| \leq n-2 ) and a Hamiltonian path when ( |F| \leq n-3 ). This establishes that ( BP_n ) is ((n-2))-hybrid fault Hamiltonian and ((n-3))-hybrid fault Hamiltonian connected for ( n \geq 3 ). These results are demonstrated to be optimal under the given conditions, with all bounds shown to be tight.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.