On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (Q1336711): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Ding-Zhu Du / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ding-Zhu Du / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3794217 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3753503 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:11, 23 May 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
