Minimum vertex covers and the spectrum of the normalized Laplacian on trees
From MaRDI portal
Publication:432729
DOI10.1016/j.laa.2012.04.005zbMath1244.05140arXiv1010.4269OpenAlexW2076293993MaRDI QIDQ432729
Publication date: 4 July 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4269
Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (10)
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains ⋮ Spectral classes of regular, random, and empirical graphs ⋮ Independence number and the normalized Laplacian eigenvalue one ⋮ The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications ⋮ On the normalized Laplacians with some classical parameters involving graph transformations ⋮ A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees ⋮ Characteristics polynomial of normalized Laplacian for trees ⋮ The normalized Laplacian spectrum of quadrilateral graphs and its applications ⋮ Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains ⋮ Bounds on normalized Laplacian eigenvalues of graphs
Cites Work
- Unnamed Item
- On the spectrum of the normalized graph Laplacian
- Spectral plot properties: towards a qualitative classification of networks
- A discrete nodal domain theorem for trees
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Interlacing eigenvalues and graphs
- The characteristic polynomial of a graph
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Discrete nodal domain theorems
This page was built for publication: Minimum vertex covers and the spectrum of the normalized Laplacian on trees
