NumberOfSpanningTrees
NumberOfSpanningTrees[g]
gives the number of labeled spanning trees of graph 
.
Combinatorica`
Combinatorica`
NumberOfSpanningTrees
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
NumberOfSpanningTrees[g]
gives the number of labeled spanning trees of graph 
.
更多信息和选项
- To use NumberOfSpanningTrees, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，NumberOfSpanningTrees，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/NumberOfSpanningTrees.html.
文本
Wolfram Research (2012)，NumberOfSpanningTrees，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/NumberOfSpanningTrees.html.
CMS
Wolfram 语言. 2012. "NumberOfSpanningTrees." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NumberOfSpanningTrees.html.
APA
Wolfram 语言. (2012). NumberOfSpanningTrees. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/NumberOfSpanningTrees.html 年