There are nn-2 trees on n labelled vertices. This is equal to the number of spanning trees on the complete graph with n vertices. See Kirchoff’s theorem.
科学参考收录了60776条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。