Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
From MaRDI portal
Publication:3073474
DOI10.1007/S10587-010-0035-1zbMATH Open1224.05319OpenAlexW1968689646MaRDI QIDQ3073474FDOQ3073474
Authors: Wei Shi, Suichao Wu, Liying 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- The Laplacian Spectrum of a Graph II
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
- Title not available (Why is that?)
- Inequalities relating domination parameters in cubic graphs
- 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
- On graphs with algebraic connectivity equal to minimum edge density
Cited In (4)
This page was built for publication: Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073474)