Article,

Deleting vertices and interlacing Laplacian eigenvalues

, , and .
Chinese Annals of Mathematics, Series B, 31 (2): 231--236 (2010)
DOI: 10.1007/s11401-008-0252-1

Abstract

The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G-U, which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges. Also, some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.

Tags

Users

  • @ytyoun

Comments and Reviews