Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.