# GraphPower

GraphPower[g,n]

gives the graph-n power of the graph g.

GraphPower[{vw,},]

uses rules vw to specify the graph g.

# Details and Options

• The graph-n 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.

# Examples

open allclose all

## Basic Examples(1)

Graph power of cycle graphs:

## Scope(5)

GraphPower works with undirected graphs:

Directed graphs:

Multigraphs:

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- powers can be obtained by the sum of the first powers of the adjacency matrix:

Wolfram Research (2010), GraphPower, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphPower.html (updated 2015).

#### Text

Wolfram Research (2010), GraphPower, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphPower.html (updated 2015).

#### CMS

Wolfram Language. 2010. "GraphPower." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/GraphPower.html.

#### APA

Wolfram Language. (2010). GraphPower. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphPower.html

#### BibTeX

@misc{reference.wolfram_2023_graphpower, author="Wolfram Research", title="{GraphPower}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/GraphPower.html}", note=[Accessed: 22-September-2023 ]}

#### BibLaTeX

@online{reference.wolfram_2023_graphpower, organization={Wolfram Research}, title={GraphPower}, year={2015}, url={https://reference.wolfram.com/language/ref/GraphPower.html}, note=[Accessed: 22-September-2023 ]}