# $k$-independence number in graphs

I know how to find the independence number in graphs in sagemath. I want to obtain a new parameter called $k$-independence number in graphs which means the maximum size of a set of vertices at pairwise distance greater than $k$.

Would you please tell me how I can find this parameter in a graph?