On the distribution of Laplacian eigenvalues of a graph

DOI10.1007/s10114-011-8624-yzbMath1227.05181OpenAlexW2077068072MaRDI QIDQ644659

Jiong Ming Zhang, Kun-fu Fang, Xiao-Li Wu, Ji-Ming Guo

Publication date: 4 November 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-8624-y

zbMATH Keywords

matching numberLaplacian eigenvaluependantneighboredge covering number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the distribution of Laplacian eigenvalues of trees ⋮ On the full Brouwer's Laplacian spectrum conjecture ⋮ Classification of trees by Laplacian eigenvalue distribution and edge covering number ⋮ Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Most Laplacian eigenvalues of a tree are small ⋮ Maximum Laplacian energy of unicyclic graphs ⋮ Domination and Spectral Graph Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Permanental roots and the star degree of a graph
• On edge singularity and eigenvectors of mixed graphs
• Upper bound for the Laplacian graph eigenvalues
• Nonsingular mixed graphs with few eigenvalues greater than two
• Non-bipartite graphs with third largest Laplacian eigenvalue less than three
• Bounds for the least Laplacian eigenvalue of a signed graph
• Shifted simplicial complexes are Laplacian integral
• The Laplacian Spectrum of a Graph
• On the third largest Laplacian eigenvalue of a graph
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• A relation between the matching number and Laplacian spectrum of a graph

This page was built for publication: On the distribution of Laplacian eigenvalues of a graph