The nth power Gn of a connected graph G is the graph with the same point set as G and where two points u and v are adjacent in Gn if and only if the distance between u and v in G is at most n. The graph G2 is called the square of G while G3 is referred to as the cube of G.