Back to Search
Start Over
The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Source :
-
Linear Algebra & its Applications . Oct2010, Vol. 433 Issue 4, p790-795. 6p. - Publication Year :
- 2010
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 433
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 51156079
- Full Text :
- https://doi.org/10.1016/j.laa.2010.04.009