| 关于含k圈标号图的计数问题 |
| |
| 引用本文： | 柳柏濂,张显坤.关于含k圈标号图的计数问题[J].数学研究及应用,1991,11(4):535-543. |
| |
| 作者姓名： | 柳柏濂 张显坤 |
| |
| 作者单位： | 华南师范大学;广东机械学院 |
| |
| 摘 要： | 含k个圈的标号图的计数问题是一个未解决问题.迄今仅对于k=1,2被解决,可是,所得出的计数式均较复杂.本文改进了已得到的一系列公式,并且解决了K=3的上述计数问题.
|
| 关 键 词： | 圈 标号图 计数问题 |
| 收稿时间： | 1990/5/14 0:00:00 |
On the Enumeration of Labeled Graphs with k Cycles |
| |
| Liu Bolian and Zhang Xiankun.On the Enumeration of Labeled Graphs with k Cycles[J].Journal of Mathematical Research with Applications,1991,11(4):535-543. |
| |
| Authors: | Liu Bolian and Zhang Xiankun |
| |
| Institution: | South China Normal University; Guangzhou;Guangdong Mechanical College; Guangzhou |
| |
| Abstract: | Enumeration of labeled connected graphs with k cycles is an open problem . Up to now it has been settled only for k = 1, 2. Unfortunately , these given for-mulas are very complicated . In this paper we improve a series of enum nerations and solve the enumeration problem for k = 3. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
