The k-independence number of a graph, αk(G), is the maximum size of a set of vertices at pairwise distance greater than k, or alternatively, the independence number of the k-th power graph Gk.
Sep 6, 2022
May 31, 2022 · In this paper we present sharp upper bounds for the k-independence number of several graph products. In particular, we focus on the Cartesian, ...
This paper generalizes and unifies the existing spectral bounds on the k -independence number of a graph, which is the maximum size of a set of vertices at ...
People also ask
What is the independence number of a graph?
What are the bounds for the independence number of a graph?
What is the independence number of KN?
What is the independent set of a graph?
May 31, 2022 · In this paper we present sharp upper bounds for the $k$-independence number of several graph products. In particular, we focus on the Cartesian, ...
The k-independence number on the lexicographical, strong, Cartesian and direct product is studied and several upper and lower bounds for these products of ...
PDF | On Nov 2, 2017, Yaping Mao and others published The k -independence number of graph products | Find, read and cite all the research you need on ...
The direct product of graphs G and H , denoted as G × H , is the graph with vertex set V ( G ) × V ( H ) , where two vertices ( x 1 , y 1 ) and ( x 2 , y 2 ) ...
We consider k-independent sets in two graph products: Cartesian and complementary prism. ... Key words: Independence number / k-independent set / Cartesian ...
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a graph, which is the maximum size of a set of vertices at ...
This paper presents sharp upper bounds for the k-independence number of several graph products, in particular, the Cartesian, tensor, strong, ...