摘要
求连通图生成树数目的方法有很多。本文利用平面图的对偶图的Kirchhoff矩阵求出梯形图,扇形图和轮图的生成树数目,这类平面图利用收缩边和去边的方法已经求出,但用本文的方法更简单直接且便于推广到一般平面图。
It has the many kinds of methods to calculate the number of spanning trees of a connected graph. In this paper, we calculate the number of spanning trees of planar graphs such as Ladders,Fans and Wheels by means of their duals.using Matrix-tree theorem.
出处
《湖南科技学院学报》
2006年第5期17-18,共2页
Journal of Hunan University of Science and Engineering
关键词
对偶图
生成树数目
矩阵树定理
The number of spanning trees
Dual
Matrix-tree theorem.
