| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653322 | European Journal of Combinatorics | 2016 | 6 Pages |
Abstract
Let mG(I)mG(I) denote the number of Laplacian eigenvalues of a graph GG in an interval II. Our main result is that for graphs having domination number γγ, mG[0,1)≤γmG[0,1)≤γ, improving existing bounds in the literature. For many graphs, mG[0,1)=γmG[0,1)=γ, or mG[0,1)=γ−1mG[0,1)=γ−1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Stephen T. Hedetniemi, David P. Jacobs, Vilmar Trevisan,