tlooto
Sign up
MathematicsComputer Science

Eigenvalues, diameter, and mean distance in graphs

B. Mohar

1991.3.1GRAPHS AND COMBINATORICS

DOI: 10.1007/bf01789463

tlooto Summary

Upper and lower bounds on the diameter and the mean distance inG in terms ofλ2, the second smallest eigenvalue of the difference Laplacian matrix of a graphG, are derived.

Abstract

Abstract is not available.

Citation format

MOHAR, B. Eigenvalues, diameter, and mean distance in graphs. GRAPHS AND COMBINATORICS, 1991, 7: 53–64.