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 
.
更多信息和选项
- 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`"].
范例
基本范例 (2)
This function has been superseded by GraphPower in the Mathematica kernel:
文本
Wolfram Research (2012)，GraphPower，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html.
CMS
Wolfram 语言. 2012. "GraphPower." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html.
APA
Wolfram 语言. (2012). GraphPower. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html 年