Super edge-connectivity of dense digraphs and graphs
From MaRDI portal
Publication:1199454
DOI10.1016/0166-218X(92)90155-4zbMath0760.05050OpenAlexW1995580361MaRDI QIDQ1199454
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)90155-4
diameterKautz digraphedge-connectivityinterconnection networknetwork reliabilityde Bruijn digraphdense digraphsminimum edge-cut setssuper-\(\lambda\)
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (24)
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Superconnected digraphs and graphs with small conditional diameters ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ A new approach to finding the extra connectivity of graphs ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Inverse degree and super edge-connectivity ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ Diameter, short paths and superconnectivity in digraphs ⋮ Super edge-connectivity of de Bruijn and Kautz undirected graphs ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ On super edge-connectivity of product graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Miscellaneous Digraph Classes ⋮ The superconnectivity of large digraphs and graphs ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
- Sufficient conditions for maximally connected dense graphs
- Large fault-tolerant interconnection networks
- Advances in graph theory
- On the impossibility of directed Moore graphs
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- On the design of reliable networks
- Connectivity of Regular Directed Graphs with Small Diameters
- Line Digraph Iterations and the (d, k) Digraph Problem
- Graphs with the smallest number of minimum cut sets
- A Design for Directed Graphs with Minimum Diameter
- Super Line-Connectivity Properties of Circulant Graphs
- Synthesis of reliable networks - a survey
- Lower-bounds on the connectivities of a graph
- Design to Minimize Diameter on Building-Block Network
- Maximally connected digraphs
- On the Invulnerability of the Regular Complete k-Partite Graphs
This page was built for publication: Super edge-connectivity of dense digraphs and graphs
