For an undirected graph G = (V,E), the kth power G(k) is the graph with the same vertex set as G such that two vertices are adjacent in G(k) if and only if their distance in G is at most k. A set of vertices A subset of or equal to V is an asteroidal set
