Strong graph power
= Strong graph power
{title2=$G^{\boxtimes m}$}
= Strong power
{synonym}
An iterated <strong graph product> has vertices that are words of length $m$ 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>.