A relation between the matching number and Laplacian spectrum of a graph (Q5932188)
From MaRDI portal
scientific article; zbMATH DE number 1595344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relation between the matching number and Laplacian spectrum of a graph |
scientific article; zbMATH DE number 1595344 |
Statements
A relation between the matching number and Laplacian spectrum of a graph (English)
0 references
25 September 2001
0 references
The Laplacian matrix of a graph \(G\) is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. The authors show that the matching number of a graph \(G\) is a lower bound for the number of Laplacian eigenvalues of \(G\) exceeding 2. This is an improvement of a result by \textit{R. Merris} [Port. Math. 48, No. 3, 345-349 (1991)].
0 references
matching number
0 references
Laplacian spectrum
0 references
Laplacian eigenvalues
0 references
