Combinatorica`
Combinatorica`

GraphPower

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

GraphPower[g,k]

gives the k^(th) power of graph g. This is the graph whose vertex set is identical to the vertex set of g and that contains an edge between vertices and for each path in g between vertices and of length at most k.

更多信息和选项

范例

基本范例  (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.

文本

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 年

BibTeX

@misc{reference.wolfram_2024_graphpower, author="Wolfram Research", title="{GraphPower}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html}", note=[Accessed: 18-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_graphpower, organization={Wolfram Research}, title={GraphPower}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/GraphPower.html}, note=[Accessed: 18-November-2024 ]}