Radius of \((2k-1)\)-connected graphs (Q2761046)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Radius of \((2k-1)\)-connected graphs |
scientific article; zbMATH DE number 1682908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Radius of \((2k-1)\)-connected graphs |
scientific article; zbMATH DE number 1682908 |
Statements
17 December 2001
0 references
radius of a graph
0 references
connectivity of a graph
0 references
Radius of \((2k-1)\)-connected graphs (English)
0 references
In the paper the upper bound for the radius of a \((2k-1)\)-connected graph (for \(k\geq 2\)) with \(n\) vertices is proved to be \(\lfloor n+2k+9\rfloor /(2k)\). The proof is done with the help of some lemmas.
0 references
