特殊图类的生成树数目  

Total Number of Spanning Trees of Special Graphs

作　　者：谢尘倩 陈平鸽 XIE Chenqian;CHEN Pingge(College of Science,Hunan University of Technology,Zhuzhou Hunan 412007,China)

机构地区：[1]湖南工业大学理学院,湖南株洲412007

出　　处：《湖南工业大学学报》2021年第3期95-98,共4页Journal of Hunan University of Technology

基　　金：湖南省教育厅科学研究基金资助项目(20C0595)。

摘　　要：基于Kirchhoff矩阵树定理,研究一些特殊图类的生成树数目问题,结合平面图的对偶图对应的Kirchhoff矩阵,得到有关递推关系方程,进而得到其生成树数目的通项公式。Based on Kirchhoff matrix tree theorem,a research has been conducted on the number of spanning trees of some special graphs.With the Kirchhoff matrix corresponding to the dual graph of planar graph combined together,the recursive relation equation can be worked out,thus obtaining the general formula of the number of spanning trees as well.

关 键 词：对偶图 生成树数目 Kirchhoff矩阵 

分 类 号：O175.5[理学—数学]