首页 | 本学科首页   官方微博 | 高级检索  
     

一类平面图的生成树数目
引用本文:赵继红,黎颖,张捷. 一类平面图的生成树数目[J]. 湖南文理学院学报(自然科学版), 2008, 20(3)
作者姓名:赵继红  黎颖  张捷
作者单位:广西师范大学,数学科学学院,广西,桂林,541004;广西师范大学,数学科学学院,广西,桂林,541004;广西师范大学,数学科学学院,广西,桂林,541004
基金项目:广西师范大学校科研和教改项目
摘    要:利用平面图的对偶图的Kirchhoff矩阵来求一些平面图的生成树数目,求这类平面图的生成树数目比直接利用Cayley公式要简单,且该方法对于同一类的平面图可以进一步推广.

关 键 词:对偶图  生成树数目  矩阵树定理

The number of spanning trees of a family of plane graph
ZHAO Ji-hong,LI Ying,ZHANG Jie. The number of spanning trees of a family of plane graph[J]. Journal of Hunan University of Arts and Science:Natural Science Edition, 2008, 20(3)
Authors:ZHAO Ji-hong  LI Ying  ZHANG Jie
Affiliation:ZHAO Ji-hong,LI Ying,ZHANG Jie (Mathematical Science College,Guangxi Normal Universtiy,Guilin Guangxi,541004)
Abstract:The number of spanning trees is an important parameter of graph, meanwhile there are many ways of caculating the number of spanning trees. The number of spanning trees of some special planar graph was counted with Kirchhoff matrix of it was dual Graph. Of course it is easier than other methods such as Cayley formula, and it can be extended to caculate the number of spanning trees of same kind but more general graph.
Keywords:Dual Graph  The number of spanning tree  Matrix- tree thorem  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号