The superconnectivity of large digraphs and graphs

DOI10.1016/0012-365X(92)00051-RMaRDI QIDQ1313826zbMATH OpenFDO

Authors V. Pereyra

Publication date 1 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)00051-R

zbMATH Keywords

digraphedge connectivitysuperconnectivityvertex connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Review text

First of all the author gives basic notions and an overview of actual results. The digraph \(D\) is said to be super-\(\kappa\) (vertex connectivity) if all its minimum disconnecting sets are trivial. Analogously, \(D\) is called super-\(\lambda\) (edge connectivity) if all its minimum edge-disconnecting sets are trivial. The author's main results are sufficient conditions for a digraph \(D\) to be super-\(\kappa\) or super-\(\lambda\). Moreover, the author gives several interesting corollaries of these theorems.

Recommendations

• Super edge-connectivity of dense digraphs and graphs
• Super connectivity of line graphs and digraphs
• Superconnectivity of bipartite digraphs and graphs
• Sufficient conditions for digraphs to be maximally connected and super-connected
• scientific article; zbMATH DE number 2191995

Cites work

• Connectivity of Kautz networks
• Connectivity of Regular Directed Graphs with Small Diameters
• 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?)
• 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

(26)

• Super edge-connectivity of dense digraphs and graphs
• Superconnectivity of bipartite digraphs and graphs
• On connectivity of the cartesian product of two graphs
• Using a progressive withdrawal procedure to study superconnectivity in digraphs
• On vosperian and superconnected vertex-transitive digraphs
• Super connectivity of line graphs and digraphs
• Realizability of fault-tolerant graphs
• Super-arc-connectivity properties of strongly connected digraphs
• Supereulerian digraphs with large arc-strong connectivity
• On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
• The properties of middle digraphs.
• Bi-super-connected digraphs
• Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
• scientific article; zbMATH DE number 4162914 (Why is no real title available?)
• Super-connected and hyper-connected jump graphs
• On super-edge-connected digraphs and bipartite digraphs
• On the connectivity of p-diamond-free vertex transitive graphs
• Maximally and super connected multisplit graphs and digraphs
• Sufficient conditions for super-arc-connected digraphs
• Supermodularity in unweighted graph optimization. III: Highly connected digraphs
• Sufficient conditions for digraphs to be maximally connected and super-connected
• The super-connectivity of graphs with two orbits
• Diameter, short paths and superconnectivity in digraphs
• Double-super-connected digraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Super-connected edge transitive 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)