一些图的生成树数

数学物理学报

一些图的生成树数

陈东; 王维凡

(浙江师范大学行知学院金华 321004; 浙江师范大学数理学院金华 321004)

收稿日期:2005-11-08 修回日期:2007-10-27 出版日期:2008-10-25 发布日期:2008-10-25
通讯作者: 陈东
基金资助:
国家自然科学基金(10771197)、浙江省自然科学基金(M103094, Y604167)资助

The Numbers of Spanning Trees in Some Graphs

Chen Dong; Wang Weifan

(Xingzhi College, Zhejiang Normal University, Jinhua 321004; Department of Mathematics, Zhejiang Normal University, Jinhua 321004)

Received:2005-11-08 Revised:2007-10-27 Online:2008-10-25 Published:2008-10-25
Contact: Chen Dong

摘要/Abstract

摘要： 图 G 的生成树是它的连通子图(子树).本文精确地计算出了一些图的生成树的数目, 例如双心轮图、双柄扇图等等.

关键词: 生成树, 双心轮, 双柄扇

Abstract: A spanning tree in a connected graph G is a spanning subgraph of G that is a tree. In this paper, the authors determine precisely the numbers of spanning trees in some special graphs such as double-center wheels, double-handle fans, etc.

Key words: Spanning tree, Double-center wheel, Double-handle fan

中图分类号:

05C05

陈东; 王维凡. 一些图的生成树数[J]. 数学物理学报, 2008, 28(5): 906-913.

Chen Dong; Wang Weifan. The Numbers of Spanning Trees in Some Graphs[J]. Acta mathematica scientia,Series A, 2008, 28(5): 906-913.

[1]	黄元秋, 刘彦佩. 图的生成树, 基本圈与Betti亏数[J]. 数学物理学报, 2004, 24(4): 496-500.
[2]	黄振杰, 李晓明. 几种复合图生成树个数的一般求法[J]. 数学物理学报, 1995, 15(3): 259-268.