GraphPower[g,k]
gives the 
power of graph 
. This is the graph whose vertex set is identical to the vertex set of 
and that contains an edge between vertices 
and 
for each path in 
between vertices 
and 
of length at most 
.
GraphPower
GraphPower[g,k]
gives the 
power of graph 
. This is the graph whose vertex set is identical to the vertex set of 
and that contains an edge between vertices 
and 
for each path in 
between vertices 
and 
of length at most 
.
Details and Options
- GraphPower functionality is now available in the built-in Wolfram Language function GraphPower.
- To use GraphPower, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
This function has been superseded by GraphPower in the Mathematica kernel:
Text
Wolfram Research (2012), GraphPower, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html.
CMS
Wolfram Language. 2012. "GraphPower." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html.
APA
Wolfram Language. (2012). GraphPower. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html