… In Section 4, we provide a full characterization of the 8 -cycles inside the burnt pancake
graph, inspired by analogous results for the pancake graph (see Konstantinova and Medvedev […

… The mutually independent hamiltonicity IHC(G) of a graph G is the maximum integer k such
… Hamiltonian cycles of G starting at u. For the ndimensional burnt pancake graph Bn, this …

… P 3 ( n ) has cycles of all possible lengths, thus resembling a similar property of pancake
graphs and burnt pancake graphs. Moreover, P 4 ( n ) has all the even-length cycles. We utilize …

… results in a disconnected graph and at least two remaining components contain cycles. Thus,
to … ) connectivity of the burnt pancake graphs BPn which is the Cayley graph of the group of …

… edge neighbor connectivity) of a graph G is the least number of vertices (resp. edges) such
… G results in a graph that is empty, complete (resp. trivial), or disconnected. For a graph G , the …

… ’s in n-pancake graphs and n-burnt pancake graphs. By analyzing the types of cycles proposed
in our … This study focuses on the pancake graph and the burnt pancake graph among the …

… A graph G is super spanning connected if G is i∗ … In this paper, we prove that the n-dimensional
burnt pancake graph … A hamiltonian cycle is a cycle of length V(G). A hamiltonian path is …

… faults” property on a burnt pancake graph B P n , which is the Cayley graph of the group of …
pancake graph, which refers to the mathematic puzzle of sorting a pile of unordered pancakes …

… Let H be a connected subgraph of a graph G. The H-structure … pancake graph and n-dimensional
burnt pancake graph, … Since P 3 is a cycle of length 6, it is easy to see that the …

… introduced the well-known burnt pancake problem in 1979. This … Let B P n denote the n
-dimensional burnt pancake graph. … F , the graph B P n − F still has a fault-free Hamiltonian cycle (…