We define a new graph operation called the inner power of a graph. The construction is similar to the direct power of graphs, except that factors are intertwined in such a way that certain structural properties of graphs are more clearly reflected in their inner powers. We investigate various properties of inner powers, such as connectivity, bipartiteness, and their interaction with the direct product. We explore possible connections between inner powers and the problem of cancellation over the direct product of graphs.