An iterated strong graph product has vertices that are words of length in the graph's vertex set. Distinct words are nonadjacent exactly when some coordinate contains distinct nonadjacent entries. This differs from the distance-based graph power.
New to topics? Read the docs here!