Super connectivity of line graphs and digraphs
From MaRDI portal
The authors establish the relationship between the \(h\)-super edge-connectivity of a graph and the super connectivity of its line graph. Furthermore, the authors show that the de Bruijn digraph \(B(d,n)\) and the Kautz digraph \(K(d,n)\) are both super connected for any \(d>1\) and \(n>0\).
Recommendations
Cited in
(23)- On super edge-connectivity of product graphs
- Super-connected arc-transitive digraphs
- Super connectivity of line graphs
- The superconnectivity of large digraphs and graphs
- Super line-connectivity of consecutive-\(d\) digraphs
- Using a progressive withdrawal procedure to study superconnectivity in digraphs
- Super link-connectivity of iterated line digraphs.
- Fault-tolerant analysis of a class of networks
- Super-arc-connectivity properties of strongly connected digraphs
- Supereulerian digraphs with large arc-strong connectivity
- Miscellaneous digraph classes
- Super-mixed-connected line digraphs.
- Restricted connectivity of total digraph
- A number theoretic problem on super line graphs
- On super connectivity of Cartesian product graphs
- Super-connected and hyper-connected jump graphs
- Maximally and super connected multisplit graphs and digraphs
- Super Edge-Connected Linear Hypergraphs
- scientific article; zbMATH DE number 5258043 (Why is no real title available?)
- Under which conditions is λ″(G)=κ″(L(G)) ?
- On reliability of the folded hypercubes
- The super connectivity of augmented cubes
- Cyclic arc-connectivity in a Cartesian product digraph
This page was built for publication: Super connectivity of line graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431926)
