Abstract

Abstract. The paper is essentially a survey of known results about the spectrum of the Laplacian matrix of graphs with special emphasis on the second smallest Lapla-cian eigenvalue λ2 and its relation to numerous graph invariants, including connectivity, expanding properties, isoperimetric number, maximum cut, independence number, genus, diameter, mean distance, and bandwidth-type parameters of a graph. Some new results and generalizations are added. † This article appeared in “Graph Theory, Combinatorics, and Applications”, Vol. 2,

Citations

398	Algebraic graph theory - Biggs - 1994
314	How to draw a graph - Tutte - 1962
294	Algebraic connectivity of graphs - Fiedler - 1973
289	Eigenvalues and expanders - Alon - 1986
281	On the Shannon capacity of a graph - Lovász
232	Eigenvalues in Riemannian Geometry - Chavel - 1984
187	A property of eigenvectors of non-negative symmetric matrices and its application to graph theory - Fiedler - 1975
159	lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
137	λ1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
132	KM: An r-dimensional quadratic placement algorithm - Hall - 1970
92	RJ: Introduction to Graph Theory - Wilson
89	Explicit construction of linear sized tolerant networks - Alon, Chung - 1988
84	Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme gefuhrt wird - Kirchhoff - 1847
59	Isoperimetric numbers of graphs - Mohar - 1989
55	A topological application of the isoperimetric inequality - Gromov, Milman - 1983
42	Better expanders and superconcentrators - Alon, Galil, et al. - 1987
39	Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory - Alon - 1986
37	A survey on spectra of infinite graphs - Mohar, Woess - 1989
36	J.R.: Space bounds for a game on graphs - Paul, Tarjan, et al. - 1977
33	Graph-theoretic properties in computational complexity - Valiant - 1976
30	Sorting in c log n parallel steps, Combinatorica 3 - Ajtai, Komlós, et al. - 1983
30	Explicit concentrators from generalized N-gons - Tanner - 1984
24	A survey of matrix theory and matrix inequalities, Allyn and - Marcus, Ming - 1964
24	Isoperimetric inequalities, growth, and the spectrum of graphs - Mohar - 1988
23	Recent results in the theory of graph spectra - Cvetković, Doob, et al. - 1988
16	A Certain Polynomial of a Graph and Graphs with an Extremal - Kelmans, Chelnokov
15	private communication - McKay, Allen
7	On hearing the shape of a drum - Fisher - 1966
7	graph polynomials, in “Progress in graph theory - Godsil, Real - 1982
7	Algebraic connectivity of trees - Grone, Merris - 1987
6	The spectral radius of infinite graphs - Biggs, Mohar, et al. - 1988
5	Tarjan, “Asymptotically Tight Bounds on Time-Space Tradeoffs in a Pebble Game - Lengauer, E - 1982
5	Characteristic vertices of trees - Merris - 1987
4	Permanent of Laplacian matrix of trees and bipartite graphs - Brualdi, Goldwasser - 1984
4	Spectra of graphs – Theory and applications, VEB Deutscher Verlag d - Cvetković, Doob, et al. - 1979
4	Permanental roots and the star degree of a graph - Faria - 1985
4	On the properties of the characteristic polynomial of a graph, in Kibernetiku – na sluzhbu kommunizmu - Kelmans - 1967
4	Comparison of graphs by their number of spanning trees - KELMANS - 1976
4	Time Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits - Tompa - 1980
3	Enlarging properties of graphs - Boshier - 1987
3	An algebraic approach to connectivity of graphs - Fiedler - 1974
3	The number of trees in a graph - Kel’mans - 1966
3	Transportation in graphs and the admittance spectrum - Maas - 1987
3	The Laplacian permanental polynomial for trees - Merris - 1982
2	Concentration of measure phenomena in the discrete case and the Laplace operator of a graph, Semin. analyse fonct - Alon, Milman - 1984
2	Schur convex functions on the spectra of graphs - Constantine - 1983
2	Configuration statistics of Gaussian molecules - Eichinger - 1980
2	Algebraische zusammenhangszahl der graphen und ihre numerische bedeutung, in Numerische Methoden bei graphentheoretischen und kombinatorischen - Fiedler - 1974
2	Time space tradeoffs for some algebraic problems - Ja’Ja - 1980
1	A note on time space tradeoffs for computing continuous functions - Abelson - 1979