Add to ORKGWe prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.Comment: 10 pages; preprint, comments are welcom
AbstractWe derive bounds on the size of an independent set based on eigenvalues. This generalizes a ...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
International audienceWe propose a new lower bound on the independence number of a graph. We show th...
AbstractWe study the Laplacian eigenvalues of trees on n vertices with independence number α and des...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
© 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://...
AbstractWe give some new bounds for the clique and independence numbers of a graph in terms of its e...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
The independence number alpha of a graph is the size of a maximum independent set of vertices. An i...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractWe derive bounds on the size of an independent set based on eigenvalues. This generalizes a ...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
International audienceWe propose a new lower bound on the independence number of a graph. We show th...
AbstractWe study the Laplacian eigenvalues of trees on n vertices with independence number α and des...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
© 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://...
AbstractWe give some new bounds for the clique and independence numbers of a graph in terms of its e...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalu...
The independence number alpha of a graph is the size of a maximum independent set of vertices. An i...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractWe derive bounds on the size of an independent set based on eigenvalues. This generalizes a ...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
International audienceWe propose a new lower bound on the independence number of a graph. We show th...