On local connectivity of graphs

DOI10.1016/j.aml.2006.12.014zbMath1134.05046OpenAlexW1978500105MaRDI QIDQ2472822

Lutz Volkmann

Publication date: 25 February 2008

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.12.014

zbMATH Keywords

local connectivityconnectivityminimum degree\(p\)-partite graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Fault-tolerant strong Menger connectivity of modified bubble-sort graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On local connectivity of graphs with given clique number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the vertex-connectivity of digraphs and graphs
• Sufficient conditions for maximally connected dense graphs
• Connectivity of large bipartite digraphs and graphs
• Bipartite graphs and digraphs with maximum connectivity
• Lower-bounds on the connectivities of a graph
• A Lower Bound on the Number of Vertices of a Graph
• Maximally connected digraphs
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• The connectivity of large digraphs and graphs
• A Lower Bound for the Number of Vertices of a Graph

This page was built for publication: On local connectivity of graphs