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

若干图类的生成树数
引用本文:王维凡 才德军. 若干图类的生成树数[J]. 辽宁大学学报(自然科学版), 1994, 21(2): 12-19
作者姓名:王维凡 才德军
作者单位:Wang Weifan Cai Dejun Department of Mathematics,Liaoning University
摘    要:连通图的生成树是该图的极小连通生成子图。本文求出了所有梯形图、扇形图和轮形图生成树的棵数,分别给出了它们的递推关系式和通项表达式.

关 键 词:生成树 梯形图 扇形图 轮形图

Number of Spanning Trees in Some Graphs
Wang Weifan Cai Dejun. Number of Spanning Trees in Some Graphs[J]. Journal of Liaoning University(Natural Sciences Edition), 1994, 21(2): 12-19
Authors:Wang Weifan Cai Dejun
Affiliation:Wang Weifan Cai Dejun Department of Mathematics,Liaoning University
Abstract:Let G be a connected graph.A spanning tree of G is a spanningsubgraph of G that is a tree.In this paper,we have provided the mathematicalformulas of calculating the number of spanning trees in some graphs such as laddeers,fans and wheels.
Keywords:Spanning tree  Ladder  Fan  Wheel.  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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