| 连通图划分定理及其在图计数中的应用 |
| |
| 引用本文： | 连通图划分定理及其在图计数中的应用[J]. 华南师范大学学报（自然科学版）, 1985, (1): 1. |
| |
| 作者姓名： | 柳柏濂 |
| |
| 摘 要： | 本文证明了关于连通图划分的一个定理.运用这个定理,简化了标号连通图和标号树的递归计数关系的证明,并导出了给定价数和根点块数的有根标号连通图和二色标号连通图的递归计数式.
|
| 关 键 词： | 连通图 递归式 计数 划分 根 |
THE THEOREM ON PARTITION OF CONNECTED GRAPH AND ITS APPLICATION IN GRAPHICAL ENUMERATION |
| |
| Liu Bolian. THE THEOREM ON PARTITION OF CONNECTED GRAPH AND ITS APPLICATION IN GRAPHICAL ENUMERATION[J]. Journal of South China Normal University(Natural Science Edition), 1985, 0(1): 1 |
| |
| Authors: | Liu Bolian |
| |
| Abstract: | This paper attempts to prove the theorem on the partition of the connected graph. With the aid of this theorem,proving recursive formulas for enumeration of connected labeled graphs and labeled trees is simplified. Therefrom is derived the generating function for rooted labeled connected graphs whose roots have a given nurnbcr of block and recursive formulas for enumeration of 2-colored labeled connected graphe. |
| |
| Keywords: | connected graph recursive formula enumeration partition root. |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《华南师范大学学报(自然科学版)》下载全文 |
