Bounds on the size of graphs of given order and \(l\)-connectivity
type: Item
instance of: scholarly article
title: Bounds on the size of graphs of given order and \(l\)-connectivity
zbMATH Open document ID: 0927.05051
DOI: 10.1016/S0012-365X(98)00236-2
published in: Discrete Mathematics
publication date: 1999-11-23T00:00:00Z
review text: The \(l\)-connectivity of a graph \(G\) of order \(p\) is the minimum number of vertices that have to be deleted from \(G\) to obtain a graph with at least \(l\) components or with fewer than \(l\) vertices. The authors provide bounds on the size of a graph of given order and \(l\)-connectivity.
reviewed by: Peter Horák
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1322014
zbMATH Keywords: \(l\)-connectivity
author: David Day
author: Ortrud R. Oellermann
author: H. C. Swart
MaRDI profile type: Publication
cites work: Q4873795
cites work: Q3335824
cites work: Q3818315
cites work: Tough graphs and Hamiltonian circuits.
cites work: On the Toughness of a Graph
cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH
cites work: On the \(\ell\)-connectivity of a graph
cites work: Q5661539
full work available at URL: s0012-365x(98)00236-2
OpenAlex ID: W2089346448
description: scientific article; zbMATH DE number 1322014