Journal
EUROPEAN JOURNAL OF COMBINATORICS
Volume 53, Issue -, Pages 66-71Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.ejc.2015.11.005
Keywords
-
Categories
Funding
- CNPq [400122/2014-6]
Ask authors/readers for more resources
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 gamma, m(G)[0, 1) <= gamma, improving existing bounds in the literature. For many graphs, m(G)[0, 1) = gamma, or m(G)[0, 1) = gamma-1. (C) 2015 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
