The least eigenvalue of a graph with a given domination number

DOI10.1016/j.laa.2012.06.007zbMath1252.05138OpenAlexW2036446799MaRDI QIDQ1758470

Bao-Xuan Zhu

Publication date: 9 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.laa.2012.06.007

zbMATH Keywords

spectral radiusdomination numberleast eigenvalue

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)

Related Items (3)

The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number ⋮ Domination and Spectral Graph Theory ⋮ Laplacian and signless Laplacian spectral radii of graphs with fixed domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic number and the least eigenvalue of a graph
• Spectral radius of graphs with given matching number
• Bounds on graph eigenvalues
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Eigenvalue bounds for independent sets
• Graphs for which the least eigenvalue is minimal. II.
• The least eigenvalue of a graph with cut vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• More spectral bounds on the clique and independence numbers
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• On the spectral radius of graphs with a given domination number
• The smallest eigenvalue of \(K_{r}\)-free graphs
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones

This page was built for publication: The least eigenvalue of a graph with a given domination number