Title
Remoteness and distance eigenvalues of a graph
Abstract
Let G be a connected graph of order n with diameter d . Remoteness ź of G is the maximum average distance from a vertex to all others and ź 1 ź ź ź ź n are the distance eigenvalues of G . Aouchiche and Hansen (0000), Aouchiche and Hansen conjectured that ź + ź 3 0 when d ź 3 and ź + ź ź 7 d 8 ź 0 . In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on ź n + ź and ź 1 - ź when G ź K n and the extremal graphs are characterized.
Year
DOI
Venue
2016
10.1016/j.dam.2016.07.018
Discrete Applied Mathematics
Keywords
Field
DocType
Remoteness,Distance matrix,Distance eigenvalues
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Connectivity,Mathematics,Eigenvalues and eigenvectors
Journal
Volume
Issue
ISSN
215
C
0166-218X
Citations 
PageRank 
References 
2
0.48
2
Authors
3
Name
Order
Citations
PageRank
Huiqiu Lin13411.56
Kinkar Ch. Das220830.32
Baoyindureng Wu39924.68