On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (Q1336711)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 681708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs |
scientific article; zbMATH DE number 681708 |
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
0.98145425
0 references
0.97256744
0 references
0 references
0.93148994
0 references
0.9263847
0 references
0.92479146
0 references
0.9229151
0 references
0.9217733
0 references
0 references
