The superconnectivity of large digraphs and graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- scientific article; zbMATH DE number 4162914 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3355058 (Why is no real title available?)
- Connectivity of Kautz networks
- Connectivity of Regular Directed Graphs with Small Diameters
- Large fault-tolerant interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- Lower-bounds on the connectivities of a graph
- Maximally connected digraphs
- On the linegraph of a directed-graph
- Sufficient conditions for maximally connected dense graphs
- Super edge-connectivity of dense digraphs and graphs
- Synthesis of reliable networks - a survey
- The connectivity of large digraphs and graphs
Cited in
(25)- Superconnectivity of bipartite digraphs and graphs
- Super-arc-connectivity properties of strongly connected digraphs
- Super edge-connectivity of dense digraphs and graphs
- On the connectivity of \(p\)-diamond-free vertex transitive graphs
- Sufficient conditions for super-arc-connected digraphs
- Using a progressive withdrawal procedure to study superconnectivity in digraphs
- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
- Double-super-connected digraphs
- scientific article; zbMATH DE number 4162914 (Why is no real title available?)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- On super-edge-connected digraphs and bipartite digraphs
- Bi-super-connected digraphs
- Super connectivity of line graphs and digraphs
- On vosperian and superconnected vertex-transitive digraphs
- Diameter, short paths and superconnectivity in digraphs
- On connectivity of the cartesian product of two graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Maximally and super connected multisplit graphs and digraphs
- On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
- Realizability of fault-tolerant graphs
- Supereulerian digraphs with large arc-strong connectivity
- The properties of middle digraphs.
- Super-connected edge transitive graphs
- Sufficient conditions for digraphs to be maximally connected and super-connected
- Super-connected and hyper-connected jump graphs
This page was built for publication: The superconnectivity of large digraphs and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313826)
