A generalisation of the diameter of a graph (Q1179271)

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.