gives the graph-n^(th) power of the graph g.


uses rules vw to specify the graph g.

Details and Options

  • The graph-n^(th) power has the same vertices, and vertex vi is adjacent to vertex vj only if there is a path of at most length n from vi to vj.
  • GraphPower works with undirected graphs, directed graphs, multigraphs, and mixed graphs.


open allclose all

Basic Examples  (1)

Graph power of cycle graphs:

Scope  (5)

GraphPower works with undirected graphs:

Directed graphs:


Mixed graphs:

Use rules to specify the graph:

Properties & Relations  (2)

Raising a connected graph to the power of its graph diameter gives a complete graph:

Graph-^(th) powers can be obtained by the sum of the first powers of the adjacency matrix:

Introduced in 2010
Updated in 2014