Eigenvalues, diameter, and mean distance in graphs Authors
Received: 18 June 1988 Revised: 28 November 1989 DOI:
Cite this article as: Mohar, B. Graphs and Combinatorics (1991) 7: 53. doi:10.1007/BF01789463 Abstract
It is well-known that the second smallest eigenvalue
λ 2 of the difference Laplacian matrix of a graph G is related to the expansion properties of G. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance in G in terms of λ 2 are derived.
This work was supported in part by the Research Council of Slovenia, Yugoslavia. A part of the work was done while the author was visiting the Ohio State University, supported by a Fulbright grant.
Download to read the full article text References
Alon, N.: Eigenvalues and expanders. Combinatorica
6 83–96 (1986)
Alon, N. Milman, V.D.:
1, isoperimetric inequalities for graphs an superconcentrators. J. Comb. Theory (B) 38 73–88 (1985)
Chung, F.R.K.: Diameters and eigenvalues. J. Amer. Math. Soc.
2 187–196 (1989)
Cvetković, D. Doob, M. Sachs, H.: Spectra of graphs. New York: Academic Press, 1979
Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J.
23 (98) 298–305 (1973)
Grone, R. Merris, R.: Algebraic connectivity of trees, Czech. Math. J.
37 (112) 660–670 (1987)
Maas, C.: Transportation in graphs and the admittance spectrum. Discrete Appl. Math.
16 31–49 (1987)
McKay, B.D.: Private communication, unpublished
Merris, R.: Characteristic vertices of trees. Linear Multilinear Algebra
22 115–131 (1987)
Mohar, B.: Isoperimetric numbers of graphs. J. Comb. Theory (B)
47 274–291 (1989)
Mohar, B.: The Laplacian spectrum of graphs. Proc. Sixth Intern. Conf. on the Theory and Applic. of Graphs. Michigan: Kalamazoo 1988, to appear
Tanner, R.M.: Explicit concentrators from generalized
n-gons. SIAM J. Algebraic Discrete Methods 5 287–293 (1984)
Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J.
25 (100) 619–633 (1975)