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 par...
Main Authors: | Mei-Mei Gu, Hong-Xia Yan, Jou-Ming Chang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/2/268 |
Similar Items
-
The structure fault tolerance of burnt pancake networks
by: Ge Huifen, et al.
Published: (2023-12-01) -
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
by: Yi-Cheng Yang, et al.
Published: (2021-01-01) -
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
by: Lutz Volkmann, et al.
Published: (2017-01-01) -
The Restricted Edge-Connectivity of Strong Product Graphs
by: Hazhe Ye, et al.
Published: (2024-03-01) -
Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
by: Volkmann Lutz
Published: (2019-05-01)