Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the size of graphs of given order and \(l\)-connectivity |
scientific article |
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
