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.
Users
Please
log in to take part in the discussion (add own reviews or comments).