期刊文献+

基于圈或路的多重星相关图的生成树数目 被引量:3

Number of spanning trees of multi-star related graphs based on cycles or paths
下载PDF
导出
摘要 利用图的标定技巧、矩阵和行列式运算、补生成树矩阵定理等理论,研究了当图G是基于圈或路的多重星图时,补图类Kn-G的生成树数目的计数问题,得到了一些特殊情况下基于圈或路的多重星相关图的生成树数目的计数公式. 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.
作者 谭秋月
出处 《天津师范大学学报(自然科学版)》 CAS 2013年第1期30-34,共5页 Journal of Tianjin Normal University:Natural Science Edition
基金 武夷学院青年资助项目(xq0929)
关键词 补图 多重星图 生成树 补生成树矩阵定理 计数公式 complement multi-star graphs spanning trees Complement-spanning-tree matrix theorem closed counting formulae
  • 相关文献

参考文献4

  • 1NIKOLOPOULOS S D,HONDOGIANNIS P. On the number ofspanning trees of multi-star related graphsfj]. Inform Process Lett,1998(65): 183—188.
  • 2YAN W M,MYRVOLD W,CHUNG K L. A formula for the numberof spanning trees of a multi-star related graph[J]. Inform ProcessLett, 1998(68):295-298.
  • 3CHUNG K L, YAN W M. On the number of spanning trees of amulticomplete/star related graph[J]. Inform Process Lett, 2000(76):113—119.
  • 4TEMPERLEY H N V. On the mutual cancellation of cluster integralsin Mayer's fugacity series[J]. Proc Phys Soc, 1964,83: 3—16.

同被引文献14

  • 1Nikolopoulos S D, Rondogiannis P. On the Number of Spanning Trees of Multi-Star Related Graphs[J]. Information Processing Letters, 1998, 65(4): 183-188.
  • 2Yan W M, Myrvold W, Chung K L. A Formula for the Number of Spanning Trees of a Multi-Star Related Graph [J]. Information Processing Letters, 1998, 68(6) : 295-298.
  • 3S. D. Nikolopoulos , P. Rondogiannis. On the number of spanning trees of multi-star related graphs[J]. In- form. Process. Lett. ,1998(65) :183-188.
  • 4W. M. Yan, W. Myrvold, K. L. Chung. A formula for the number of spanning trees of a multi- star related graph[J]. Inform. Process. Lett., 1998 (68):295- 298.
  • 5复杂网络理论及其应用[M]. 清华大学出版社, 2006.复杂网络理论及其应用[M]清华大学出版社,2006.
  • 6Zhongzhi Zhang,Hongxiao Liu,Bin Wu,Shuigeng Zhou.Enumeration of spanning trees in a pseudofractal scale-free web[J]. EPL (Europhysics Letters) . 2010 (6)
  • 7Elmar Teufl,Stephan Wagner.Determinant identities for Laplace matrices[J]. Linear Algebra and Its Applications . 2009 (1)
  • 8Dorogovtsev SN,Goltsev AV,Mendes JFF.Pseudofractal scale-free web. Physical Review E Statistical, Nonlinear and Soft Matter Physics . 2002
  • 9章忠志,周水庚,方锦清.复杂网络确定性模型研究的最新进展[J].复杂系统与复杂性科学,2008,5(4):29-46. 被引量:21
  • 10霍玉洪,万禧,李晓毅.五面体平图中的生成树的构造与计数[J].沈阳师范大学学报(自然科学版),2010,28(2):148-150. 被引量:6

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部