| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600766 | Linear Algebra and its Applications | 2012 | 6 Pages |
Abstract
In this paper, we characterize the unique graph whose least eigenvalue achieves the minimum among all graphs with n vertices and domination number γ. Thus we can obtain a lower bound on the least eigenvalue of a graph in terms of the domination number.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
