Sharp upper bounds on the $k$-independence number in graphs with given minimum and maximum degree

Zhenyu Taoqiu, Suil O, Yongtang Shi

The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sh…