Combinatorica`
Combinatorica`

GraphPolynomial

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

GraphPolynomial[n,x]

returns a polynomial in x in which the coefficient of x^(m) is the number of nonisomorphic graphs with n vertices and m edges.

GraphPolynomial[n,x,Directed]

returns a polynomial in x in which the coefficient of x^(m) is the number of nonisomorphic directed graphs with n vertices and m edges.

更多信息和选项

Wolfram Research (2012),GraphPolynomial,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/GraphPolynomial.html.

文本

Wolfram Research (2012),GraphPolynomial,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/GraphPolynomial.html.

CMS

Wolfram 语言. 2012. "GraphPolynomial." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GraphPolynomial.html.

APA

Wolfram 语言. (2012). GraphPolynomial. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/GraphPolynomial.html 年

BibTeX

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

BibLaTeX

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