In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is the maximum size of a set of vertices at pairwise distance greater than k. We construct graphs that attain equality for our first bound and show that our second bound compares favorably to previous bounds on the k-independence number. </p
© 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractThe local independence number αi(G) of a graph G at a distance i is the maximum number of in...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
In this paper, we study spectral versions of the densest subgraph problem and the largest independen...
Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set...
© 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractThe local independence number αi(G) of a graph G at a distance i is the maximum number of in...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
AbstractWe obtain a sequence k1(G) ≤ k2(G) ≤ … ≤ kn(G) of lower bounds for the clique number (size o...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
A well-known upper bound for the independence number α(G) of a graph G, due to Cvetković, is that α(...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
In this paper, we study spectral versions of the densest subgraph problem and the largest independen...
Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set...
© 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractThe local independence number αi(G) of a graph G at a distance i is the maximum number of in...
DOI
Add to ORKG