利用电阻等效转化方法,得到了一类伪分形网络前后两代生成树的加权函数所满足的递推关系,利用此关系,得到了这类伪分形网络的生成树计数的解析解,并用Kirchhoff矩阵-树定理验证了此生成树计数关于前两代所得到的结果。
We obtained a relationship for the weighted number of spanning trees in the successive two generations of a family of pseudo-fractal network by electrically equivalent transformations.Then we derive the analytical expression for enumeration of spanning trees.Finally,we verify the results of the first two generations by Kirchhoff matrix-tree theorem.