| 广义轮型完全多部图的生成树数 |
| |
| 引用本文： | 左亚丽,蔡俊亮.广义轮型完全多部图的生成树数[J].北京师范大学学报(自然科学版),2012,48(4):335-340. |
| |
| 作者姓名： | 左亚丽 蔡俊亮 |
| |
| 作者单位： | 河北民族师范学院数学与计算机系,承德,067000;北京师范大学数学科学学院,数学与复杂系统教育部重点实验室,北京100875 |
| |
| 基金项目： | 中央高校基本科研业务费专项资金资助项目，北京师范大学重点学科基金 |
| |
| 摘 要： | 证明了如下结论:设KWk,n是由轮图集W={Wn1,Wn2,…,Wnk}生成的n阶广义轮型完全k-部图,其中n={n1,n2,…,nk},n=|n|=n1+n2+…+nk,1≤k≤n.那么KWk,n的生成树数目为t(KWk,n)=n2k-2∏ki=1αni-1i+βni-1i-2n-ni+1,其中αi=(di+d2i-4)/2,βi=(di-d2i-4)/2,di=n-ni+3.
|
| 关 键 词： | 简单连通图 完全图 k-部图 树 |
THE NUMBER OF SPANNING TREES IN GENERALIZED COMPLETE MULTIPARTITE GRAPHS OF WHEEL-TYPE |
| |
| ZUO Yali,CAI Junliang.THE NUMBER OF SPANNING TREES IN GENERALIZED COMPLETE MULTIPARTITE GRAPHS OF WHEEL-TYPE[J].Journal of Beijing Normal University(Natural Science),2012,48(4):335-340. |
| |
| Authors: | ZUO Yali CAI Junliang |
| |
| Institution: | 1)Department of Mathematics and Computer Science,Hebei Normal University for Nationalities,067000,Chengde,Hebei,China; 2) School of Mathematical Sciences,Key Laboratory of Mathematics and Complex Systems of Minstry of Education, Beijing Normal University,100875,Beijing,China) |
| |
| Abstract: | The following is proved in this paper.Let KWk,n be a generalized complete k-partitegraph of order n spanned by the wheel set W={Wn1,Wn2,…,Wnk} wheren={n1,n2,…,nk} and n=|n|=n1+n2+…+nk for 1≤k≤n,then the number ofspanning trees in KWk,n is t(KWk,n)=n2k-2∏k i=1 αni-1i+βni-1i-2 n-ni+1,where αi=(di+d2i-4)/2,βi=(di-d2i-4)/2 and di=n-ni+3. |
| |
| Keywords: | connected simple graph k-partite graph complete graph tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
