The superconnectivity of large digraphs and graphs

DOI10.1016/0012-365X(92)00051-RzbMath0791.05068MaRDI QIDQ1313826

V. Pereyra

Publication date: 1 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphvertex connectivityedge connectivitysuperconnectivity

Mathematics Subject Classification ID

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

Related Items (9)

On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ On vosperian and superconnected vertex-transitive digraphs ⋮ Super-connected and hyper-connected jump graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Super-connected edge transitive graphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On connectivity of the cartesian product of two graphs ⋮ Realizability of fault-tolerant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Kautz networks
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• Super edge-connectivity of dense digraphs and graphs
• On the linegraph of a directed-graph
• Connectivity of Regular Directed Graphs with Small Diameters
• Line Digraph Iterations and the (d, k) Digraph Problem
• Synthesis of reliable networks - a survey
• Lower-bounds on the connectivities of a graph
• Maximally connected digraphs
• The connectivity of large digraphs and graphs

This page was built for publication: The superconnectivity of large digraphs and graphs