Let m G ( I ) denote the number of Laplacian eigenvalues of a graph G in an interval I . Our main result is that for graphs having domination number γ , m G 0 , 1 ) ? γ , improving existing bounds in the literature. For many graphs, m G 0 , 1 ) = γ , or m G 0 , 1 ) = γ - 1 .
['Stephen T. Hedetniemi', 'David Pokrass Jacobs', 'Vilmar Trevisan']
Domination number and Laplacian eigenvalue distribution