树扩图的生成树数

Number of Spanning Trees of Some Extended Trees

连通图的生成树是指该图的极小连通生成子图.本文在Cayley公式的基础上,给出每一树扩图类Pn(t)、K1,n-1(t)、Tn(a1,a2,…,ak;t)、Tn,k(t)中的图的生成树数相同.

Let G be a connected graph, a spanning tree of G is a spanning s this paper, we have provided that they have the same number of spanning trees ubgraph of G which is a tree. In of extended trees Pn（t）、K1,n-1（t）、Tn（a1,a2,…,ak;t）、Tn,k（t）, and Tn,k（t）.