On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (Q1336711): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs |
scientific article |
Statements
On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (English)
0 references
8 December 1994
0 references
The authors study the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs. The \(k\)-diameter of a graph \(G\) is the maximum diameter of the graphs obtained from \(G\) by removing \(k-1\) vertices. It is shown that every \(k\)- regular \(k\)-connected graph on \(n\) vertices has \(k\)-diameter at most \(n/2\) and this upper bound can be achieved at some graphs.
0 references
\(k\)-regular \(k\)-connected graphs
0 references
diameter
0 references
upper bound
0 references
