Bounds on Laplacian eigenvalues related to total and signed domination of graphs
From MaRDI portal
Publication:3073474
DOI10.1007/s10587-010-0035-1zbMath1224.05319MaRDI QIDQ3073474
Wei Shi, Suichao Wu, Li-ying Kang
Publication date: 11 February 2011
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/38009
Laplacian matrix; signed domination; algebraic connectivity; total domination; Laplacian spectral radius
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Minimizing the Laplacian eigenvalues for trees with given domination number
- Laplacian matrices of graphs: A survey
- On graphs with algebraic connectivity equal to minimum edge density
- Inequalities relating domination parameters in cubic graphs
- Total domination in graphs
- The Laplacian Spectrum of a Graph II
- Some remarks on domination
- Graphs with large total domination number