Eigenvalues, diameter, and mean distance in graphs
- Cite this article as:
- Mohar, B. Graphs and Combinatorics (1991) 7: 53. doi:10.1007/BF01789463
- 346 Downloads
It is well-known that the second smallest eigenvalueλ2 of the difference Laplacian matrix of a graphG is related to the expansion properties ofG. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance inG in terms ofλ2 are derived.