Bounds on the size of graphs of given order and \(l\)-connectivity

DOI10.1016/S0012-365X(98)00236-2zbMath0927.05051OpenAlexW2089346448MaRDI QIDQ1292831

Ortrud R. Oellermann, Henda C. Swart, David P. Day

Publication date: 23 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00236-2

zbMATH Keywords

\(l\)-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (5)

ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs ⋮ Toughness in pseudo-random graphs ⋮ The 4-component connectivity of alternating group networks ⋮ The \(g\)-component connectivity of graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(\ell\)-connectivity of a graph
• Tough graphs and Hamiltonian circuits.
• On the Toughness of a Graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Bounds on the size of graphs of given order and \(l\)-connectivity