Eigenvalues of graph Laplacians via rank-one perturbations

DOI10.1093/QMATH/HAAB045MaRDI QIDQ5083122zbMATH OpenOpenAlexFDO

Authors Steven Klee, Matthew T. Stamps

Publication date 21 June 2022

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.01669

zbMATH Keywords

Kirchhoff's matrix tree theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations for the characteristic polynomials of the Laplacians for several well known families of graphs, including complete, complete multipartite, and threshold graphs.

Recommendations

• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• Spanning tree enumeration and nearly triangular graph Laplacians
• The Laplacian spectral radius of a graph under perturbation
• The Laplacian Spectrum of a Graph
• Special integral variation of trees

Cited in

(3)

• On the graph Laplacian and the rankability of data
• scientific article; zbMATH DE number 4002131 (Why is no real title available?)
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗

This page was built for publication: Eigenvalues of graph Laplacians via rank-one perturbations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5083122)