On computing a conditional edge-connectivity of a graph
Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
On restricted edge-connectivity of graphs
Discrete Mathematics
Note on the connectivity of line graphs
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
On reliability of the folded hypercubes
Information Sciences: an International Journal
Fault-tolerant analysis of a class of networks
Information Processing Letters
The super connectivity of augmented cubes
Information Processing Letters
Diameter-sufficient conditions for a graph to be super-restricted connected
Discrete Applied Mathematics
Super p-restricted edge connectivity of line graphs
Information Sciences: an International Journal
Hi-index | 0.89 |
The super connectivity κ' and the super edge-connectivity λ' are more refined network reliability indices than connectivity κ and edge-connectivity λ. This paper shows that for a connected graph G with order at least four rather than a star and its line graph L(G), κ'(L(G)) = λ'(G) if and only if G is not super-λ'. As a consequence, we obtain the result of Hellwig et al. [Note on the connectivity of line graphs, Inform. Process. Lett. 91 (2004) 7] that κ(L(G)) = λ'(G). Furthermore, the authors show that the line graph of a super-λ' graph is super-λ if the minimum degree is at least three.