【摘要】 推广了计算图的支撑树个数的递归公式,解释了组合计数原理的用法.用组合技巧和常系数线性递归序列的解法,对n步梯、n-棱柱、Mobius n-棱柱及有关图,找到了计算它们的支撑树的个数的若干公式.更多还原

【Abstract】 In this article,we generalize the recurrent formula for computing number of spanning tree of graph,and explan the use of combinatorial count principle.By combinatorial technic and solution of liner recurrent sequence with constant coefficient,some formula for calculus number of spanning tree of n-lader Ln,n-prism Pn,Mobius n-prism Xn and related graphs have been found.更多还原