Domination number and Laplacian eigenvalue of trees
From MaRDI portal
Publication:1987016
DOI10.1016/j.laa.2020.01.025zbMath1437.05186MaRDI QIDQ1987016
Jie Xue, Guanglong Yu, Jin-Long Shu, Rui-fang Liu
Publication date: 9 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.01.025
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on the domination number of a tree
- Permanental roots and the star degree of a graph
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Starlike trees are determined by their Laplacian spectrum
- Domination number and Laplacian eigenvalue distribution
- On domination number and distance in graphs
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- Laplacian distribution and domination
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Lower bounds for the domination number
- On the multiplicity of laplacian eigenvalues of graphs
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- Lower bound on the domination number of a tree
- Fractional matching number and eigenvalues of a graph
- A relation between the matching number and Laplacian spectrum of a graph
