| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657538 | Journal of Combinatorial Theory, Series B | 2007 | 7 Pages |
Abstract
In this paper, we present lower and upper bounds for the independence number α(G) and the clique number ω(G) involving the Laplacian eigenvalues of the graph G.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
