Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let ∂1≥⋯≥∂n$\partial_{1}\geq\cdots\geq\partial_{n}$, ∂1L≥⋯≥∂nL$\partial_{1}^{L}\geq\cdots\geq\partial_{n}^{L}$ and ∂1Q≥⋯≥∂nQ$\partial_{1} ^{Q}\geq\cdots\geq\partial_{n}^{Q}$ be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on ρ+∂1$\rho+\partial _{1}$, ρ−∂n$\rho-\partial_{n}$, ρ+∂1L$\rho+\partial_{1}^{L}$, ∂1L−ρ$\partial_{1} ^{L}-\rho$, 2ρ+∂1Q$2\rho+\partial_{1}^{Q}$ and ∂1Q−2ρ$\partial_{1}^{Q}-2\rho$ and the corresponding extremal graphs are also characterized.
Remoteness, proximity and few other distance invariants in graphs
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and minimal trees for the difference of remoteness and radius proving thus that the corresponding conjectures posed in [4] hold for trees.
On the least distance eigenvalue of a graph
Abstract Denote by D ( G ) = ( d i , j ) n × n the distance matrix of a connected graph G with n vertices, where d i j is equal to the distance between vertices v i and v j in G. The least eigenvalue of D ( G ) is called the least distance eigenvalue of G, denoted by λ n . In this paper, we determine all the graphs with λ n ∈ [ − 2.383 , 0 ] .