数学杂志2000，Vol.20Issue(4)：473-478,6.
具有割点的标号Euler图的计数
ENUMERATION OF LABELED EULER GRAPHS WITH CUT VERTICES
金应烈 1金昌录2
作者信息
- 1. 南开大学组合数学研究中心,天津,300071
- 2. 延边大学数学系,延吉,133002
- 折叠
摘要
Abstract
This paper discusses the enumeration of labeled Euler graphs with k(k≥2) cut vertices distributed only on one 2-connected Euler graph. In this paper we give the exponential generating function for labeled Euler graphs having exactly n 2-connected Euler graphs and the k(k≥2) cut vertices distributed only on one 2-connected Euler graph.关键词
计数/2-连通Euler图/割点/生成函数Key words
Enumeration, 2-conncted Euler graph, Cut vertex, Generating function分类
数理科学引用本文复制引用
金应烈,金昌录..具有割点的标号Euler图的计数[J].数学杂志,2000,20(4):473-478,6.
