Lower bounds on the vertex-connectivity of digraphs and graphs

DOI10.1016/j.ipl.2006.03.001zbMath1186.05077OpenAlexW2026147715MaRDI QIDQ845669

Angelika Hellwig, Lutz Volkmann

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.03.001

zbMATH Keywords

connectivityfault toleranceminimum degreedegree sequencemaximum degree

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items

Maximally edge-connected and vertex-connected graphs and digraphs: A survey, On local connectivity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The connectivity of strongly regular graphs
• Sufficient conditions for maximally connected dense graphs
• On computing a conditional edge-connectivity of a graph
• Connectivity of large bipartite digraphs and graphs
• Bipartite graphs and digraphs with maximum connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• Lower-bounds on the connectivities of a graph
• Maximally connected digraphs
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• The connectivity of large digraphs and graphs