Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
From MaRDI portal
Publication:3073474
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Graphs with large total domination number
- Inequalities relating domination parameters in cubic graphs
- Laplacian matrices of graphs: A survey
- Minimizing the Laplacian eigenvalues for trees with given domination number
- On graphs with algebraic connectivity equal to minimum edge density
- Some remarks on domination
- The Laplacian Spectrum of a Graph II
- Total domination in graphs
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)