Remoteness and distance eigenvalues of a graph

Huiqiu Lin, Kinkar Ch. Das, Baoyindureng Wu

Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\rho$ of $G$ is the maximum average distance from a vertex to all others and $\partial_1\geq\cdots\geq \partia…