A Validation of the Phenomenon of Linearly Many Faults on Burnt Pancake Graphs with Its Applications

“Linearly many faults” is a phenomenon observed by Cheng and Lipták in which a specific structure emerges when a graph is disconnected and often occurs in various interconnection networks. This phenomenon means that if a certain number of vertices or edges are deleted from a graph, the remaining part either stays connected or breaks into one large component along with smaller components with just a few vertices. This phenomenon can be observed in many types of graphs and has important implications for network analysis and optimization. In this paper, we first validate the phenomenon of linearly many faults for surviving graph of a burnt pancake graph B P n when removing any edge subset with a size of approximately six times λ ( B P n ) . For graph G , the ℓ -component edge connectivity denoted as λ ℓ ( G ) (resp., the ℓ -extra edge connectivity denoted as λ ( ℓ ) ( G ) ) is the cardinality of a minimum edge subset S such that G − S is disconnected and has at least ℓ components (resp., each component of G − S has at least ℓ + 1 vertices). Both λ ℓ ( G ) and e λ ( ℓ ) ( G ) are essential metrics for network reliability assessment. Specifically, from the property of “linearly many faults”, we may further prove that λ 5 ( B P n ) = λ ( 3 ) ( B P n ) + 3 = 4 n − 3 for n ⩾ 5 ; λ 6 ( B P n ) = λ ( 4 ) ( B P n ) + 4 = 5 n − 4 and λ 7 ( B P n ) = λ ( 5 ) ( B P n ) + 5 = 6 n − 5 for n ⩾ 6 .