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

DOI10.1016/S0012-365X(98)00236-2MaRDI QIDQ1292831zbMATH OpenOpenAlexFDO

Authors David Day, Ortrud R. Oellermann, H. C. Swart

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)

Recommendations

• Characterization of minimally \((2,l)\)-connected graphs
• A lower bound of the \(l\)-edge-connectivity and optimal graphs
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• On the \(\ell\)-connectivity of a graph
• scientific article; zbMATH DE number 1289751

Cites work

• scientific article; zbMATH DE number 3867381 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 867682 (Why is no real title available?)
• scientific article; zbMATH DE number 3394182 (Why is no real title available?)
• On the Toughness of a Graph
• On the \(\ell\)-connectivity of a graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Tough graphs and Hamiltonian circuits.

Cited in

(18)

• On the \(\ell\)-connectivity of a graph
• Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
• scientific article; zbMATH DE number 870914 (Why is no real title available?)
• A lower bound of the \(l\)-edge-connectivity and optimal graphs
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• A bound on the size of a graph with given order and bondage number
• Some bounds on the A_α-index of connected graphs with fixed order and size
• The 4-component connectivity of alternating group networks
• scientific article; zbMATH DE number 2186977 (Why is no real title available?)
• Size, Order, and Connected Domination
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• The \(g\)-component connectivity of graphs
• Characterization of minimally \((2,l)\)-connected graphs
• \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
• Toughness in pseudo-random graphs
• Sharp bounds on the order, size, and stability number of graphs
• scientific article; zbMATH DE number 4070940 (Why is no real title available?)
• scientific article; zbMATH DE number 4023324 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292831)