| 基于圈或路的多重星相关图的生成树数目 |
| |
| 引用本文： | 谭秋月.基于圈或路的多重星相关图的生成树数目[J].天津师范大学学报(自然科学版),2013,33(1):30-34. |
| |
| 作者姓名： | 谭秋月 |
| |
| 作者单位： | 武夷学院数学与计算机系,福建武夷山,354300 |
| |
| 摘 要： | 利用图的标定技巧、矩阵和行列式运算、补生成树矩阵定理等理论，研究了当图G是基于圈或路的多重星图时，补图类Kn-G的生成树数目的计数问题，得到了一些特殊情况下基于圈或路的多重星相关图的生成树数目的计数公式．
|
| 关 键 词： | 补图 多重星图 生成树 补生成树矩阵定理 计数公式 |
Number of spanning trees of multi-star related graphs based on cycles or paths |
| |
| TAN Qiuyue.Number of spanning trees of multi-star related graphs based on cycles or paths[J].Journal of Tianjin Normal University(Natural Science Edition),2013,33(1):30-34. |
| |
| Authors: | TAN Qiuyue |
| |
| Institution: | TAN Qiuyue(Department of Mathematics and Computer,Wuyi University,Wuyishan 354300,Fujian Province,China) |
| |
| Abstract: | By using labeling technique, matrix determinant computations and Complement-spanning-tree matrix theorem, some closed counting formulae for the number of spanning trees of Kn-G are obtained, when G is some special multi-star graph based on cycles or paths. |
| |
| Keywords: | complement multi-star graphs spanning trees Complement-spanning-tree matrix theorem closed counting formulae |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
