| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601633 | Linear Algebra and its Applications | 2010 | 6 Pages |
Abstract
In this paper we characterize the unique graph whose least eigenvalue attains the minimum among all graphs of a fixed order and a given vertex (edge) independence number or vertex (edge) cover number, and get some bounds for the vertex (edge) independence number, vertex (edge) cover number of a graph in terms of the least eigenvalue of the graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
