A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities

DOI10.1016/j.laa.2022.11.008zbMath1504.05207arXiv2109.06269OpenAlexW4309763947MaRDI QIDQ2104984

Yanyan Li

Publication date: 8 December 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.06269

zbMATH Keywords

adjacency matrixrankLaplacian matrixtotal domination numbereigenvalue multiplicity\(p\)-domination number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of graphs with rank 5
• Bounds on graph eigenvalues. I
• Domination number and Laplacian eigenvalue distribution
• A sharp upper bound on algebraic connectivity using domination number
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• A study of eigenspaces of graphs
• An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
• A note on Laplacian eigenvalues and domination
• Dominating Sets and Eigenvalues of Graphs
• Laplacian and signless Laplacian spectral radii of graphs with fixed domination number

This page was built for publication: A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities