On the minimum number of maximal distance-$k$ independent sets in trees

Dmitrii Taletskii

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k+1$. For all $n,k\ge 1$, we determine…