Bounds on Laplacian eigenvalues related to total and signed domination of graphs

DOI10.1007/s10587-010-0035-1zbMath1224.05319OpenAlexW1968689646MaRDI 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

zbMATH Keywords

Laplacian matrixsigned dominationalgebraic connectivitytotal dominationLaplacian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Domination and Spectral Graph Theory ⋮ Signed and Minus Dominating Functions in Graphs

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

This page was built for publication: Bounds on Laplacian eigenvalues related to total and signed domination of graphs