一类广义双锥图的生成树数目

The number of spanning trees for a class of generalized bicone graphs

证明了一类广义双锥图的生成树数目可以转化为一个二阶行列式的计算,以此得到了特殊图类的生成树数目的显式表达式,并推广已有的结果.

In this study,it is proved that finding N of a class of generalized biconic graphs can be converted into a calculation of a determinant of order 2.Based on this proof,explicit expressions for N of some special families of graphs are obtained,thus generalizing existing results.