凌捷.关于K圈标号图的计数(英文)[J].数学研究及应用,1989,9(4):585~590
关于K圈标号图的计数(英文)
Enumeration on the Labeled Graphs With K Cycles
投稿时间:1987-11-12  
DOI:10.3770/j.issn:1000-341X.1989.04.026
中文关键词:  
英文关键词:
基金项目:
作者单位
凌捷 广东工学院 
摘要点击次数: 1655
全文下载次数: 992
中文摘要:
      本文研究含K个圈的标号图的计数问题,得出了有n个标定顶点且有K个交于一点的圈的连通图的计数公式,并得到了双圈连通标号图的计数公式,从而解决了K-2时连通图的计数问题。
英文摘要:
      In this paper, we continue the study of the enumeration problems of labeled graphs with k cycles that Tomscu didn't solve. A counting formula for the connected graphs with n labeled vertices and k cycles intersecting at a point is given. As an application, together with Tomscu's result we solve the enumeration problem of labeled connected graphs with two cycles.
查看全文  查看/发表评论  下载PDF阅读器