A generalisation of the diameter of a graph (Q1179271)
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: A generalisation of the diameter of a graph |
scientific article; zbMATH DE number 24178
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalisation of the diameter of a graph |
scientific article; zbMATH DE number 24178 |
Statements
A generalisation of the diameter of a graph (English)
0 references
26 June 1992
0 references
Let \(G\) be a connected graph of order \(p\) and \(a_ 1,\dots,a_ n\) \((n\geq 2)\) vertices of \(G\). It is shown that there are \(i<j\leq n\) such that \(\rho(a_ i,a_ j)\leq 2\lfloor(p-1)/n\rfloor\) if \(n\) does not divide \(p\), and \(\leq 2\lfloor(p-1)/n\rfloor+1\) otherwise.
0 references
diameter
0 references
connected graph
0 references
