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

DOI10.1016/S0012-365X(98)00236-2zbMATH Open0927.05051OpenAlexW2089346448MaRDI QIDQ1292831FDOQ1292831

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

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

zbMATH Keywords

\(l\)-connectivity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Tough graphs and Hamiltonian circuits.
• On the \(\ell\)-connectivity of a graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Title not available (Why is that?)
• On the Toughness of a Graph
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

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

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)