## The Laplacian spectrum of graphs (1991)

Venue: | Graph Theory, Combinatorics, and Applications |

Citations: | 151 - 1 self |

### BibTeX

@INPROCEEDINGS{Mohar91thelaplacian,

author = {Bojan Mohar},

title = {The Laplacian spectrum of graphs},

booktitle = {Graph Theory, Combinatorics, and Applications},

year = {1991},

pages = {871--898},

publisher = {Wiley}

}

### Years of Citing Articles

### OpenURL

### 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,