Please use this identifier to cite or link to this item:
|Title:||Average distance in graphs and eigenvalues|
|Publisher:||ELSEVIER SCIENCE BV|
|Citation:||DISCRETE MATHEMATICS, 309(10), 3458-3462|
|Abstract:||Brendan McKay gave the following formula relating the average distance between pairs of vertices in a tree T and the eigenvalues of its Laplacian: (d) over bar (T) = 2/n-1 Sigma(n)(i=2) 1/lambda(i). By modifying Mohar's proof of this result, we prove that for any graph G, its average distance, (d) over bar (G), between pairs of vertices satisfies the following inequality: (d) over bar (G) >= 2/n-1 Sigma(n)(i=2) 1/lambda(i). This solves a conjecture of Graffiti. We also present a generalization of this result to the average of suitably defined distances for k subsets of a graph. (C) 2008|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.