2 papers
math.CO2025
Probability model of edge-fault tolerance for regular graphs with respect to edge connectivity
Huanshen Jia, Jianguo Qian
We consider the probability model of edge-fault tolerance of a network in the sense of connectivity with link faults. Using graph-theoretical notation, we define the edge-fault (EF…
math.CO2022
Menger-type connectivity of line graphs of faulty hypercubes
Huanshen Jia, Jianguo Qian
A connected graph is called strongly Menger edge connected if has min\{deg, deg\} edge-disjoint paths between any two distinct vertices and in . In…