Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4873795 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3335824 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818315 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Toughness of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the \(\ell\)-connectivity of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661539 / rank | |||
Normal rank | |||
Revision as of 20:35, 28 May 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
