The multiplicity of Laplacian eigenvalue two in unicyclic graphs

DOI10.1016/J.LAA.2013.11.022MaRDI QIDQ2442279zbMATH OpenOpenAlexFDO

Authors Dariush Kiani, Maryam Mirzakhah, S. Akbari

Publication date 2 April 2014

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

Full work available at URL https://doi.org/10.1016/j.laa.2013.11.022

zbMATH Keywords

Laplacian matrixmultiplicityunicyclic graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
• The eigenvalue problem of the multicyclic graph
• Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
• Laplacian spectral characterization of some unicyclic graphs
• A class of unicyclic graphs determined by their Laplacian spectrum

Cites work

• A relation between the matching number and Laplacian spectrum of a graph
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• On the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• On the eigenvalue two and matching number of a tree
• The Laplacian Spectrum of a Graph

Cited in

(15)

• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
• The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
• Laplacian coefficients of unicyclic graphs with the number of leaves and girth
• The eigenvalue problem of the multicyclic graph
• Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
• On the multiplicity of Laplacian eigenvalues for unicyclic graphs
• The multiplicity of eigenvalues of unicyclic graphs
• On the Laplacian spectrum of k-symmetric graphs
• Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
• Classification of graphs of order n with a Laplacian eigenvalue of multiplicity n - 2
• Characterization of trees with Laplacian eigenvalue multiplicity one less than the number of pendant vertices
• Characterization of graphs whose Laplacian eigenvalue 1 has multiplicity 2 c ( G ) +  p ( G ) − 1
• Improved upper bound of multiplicity of (signless) Laplacian eigenvalue two
• Upper bounds for the multiplicity of Laplacian eigenvalues of graphs
• Multiplicity of Laplacian eigenvalues in terms of cyclomatic number and number of quasi-pendant vertices

This page was built for publication: The multiplicity of Laplacian eigenvalue two in unicyclic graphs

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