Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds on the size of graphs of given order and l-connectivity |
scientific article; zbMATH DE number 1322014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the size of graphs of given order and \(l\)-connectivity |
scientific article; zbMATH DE number 1322014 |
Statements
Bounds on the size of graphs of given order and \(l\)-connectivity (English)
0 references
23 November 1999
0 references
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.
0 references
\(l\)-connectivity
0 references
0.8115821480751038
0 references
0.8048272728919983
0 references
0.7985559105873108
0 references
0.7955988049507141
0 references
