Graph reduction techniques and the multiplicity of the Laplacian eigenvalues

DOI10.1016/j.laa.2016.04.008zbMath1338.05157arXiv1512.08265OpenAlexW2269125851MaRDI QIDQ277144

Dariush Kiani, Asghar Bahmani

Publication date: 4 May 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

eigenvalueadjacency matrixweighted graphLaplacian matrixsignless Laplacian matrixeigenvalue multiplicitystar setParter-Wiener vertex

Mathematics Subject Classification ID

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

Related Items (3)

Graph reduction techniques and the multiplicity of the Laplacian eigenvalues ⋮ The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching ⋮ Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph reduction techniques and the multiplicity of the Laplacian eigenvalues
• Permanental roots and the star degree of a graph
• Laplacian graph eigenvectors
• The Gewirtz graph: An exercise in the theory of graph spectra
• Computation of minimal rank and path cover number for certain graphs
• Tree simplification and the `plateaux' phenomenon of graph Laplacian eigenvalues
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II

This page was built for publication: Graph reduction techniques and the multiplicity of the Laplacian eigenvalues