Interlacing Theorem for the Laplacian Spectrum of a Graph
Mathematica Moravica, Tome 9 (2005) no. 1.
Voir la notice de l'article dans eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
It is well known that the Interlacing theorem for the Laplacian spectrum of a finite graph and its induced subgraphs is not true in a general case. In this paper we completely describe all simple finite graphs for which this theorem is true. Besides, we prove a variant of the Interlacing theorem for Laplacian spectrum and induced subgraphs of a graph which is true in general
case.
Mots-clés :
Simple graphs, Laplacian spectrum
@article{MM3_2005_9_1_a2, author = {Mirjana Lazi\'c}, title = {Interlacing {Theorem} for the {Laplacian} {Spectrum} of a {Graph}}, journal = {Mathematica Moravica}, pages = {13 - 16}, publisher = {mathdoc}, volume = {9}, number = {1}, year = {2005}, url = {https://geodesic-test.mathdoc.fr/item/MM3_2005_9_1_a2/} }
Mirjana Lazić. Interlacing Theorem for the Laplacian Spectrum of a Graph. Mathematica Moravica, Tome 9 (2005) no. 1. https://geodesic-test.mathdoc.fr/item/MM3_2005_9_1_a2/