| 至多有两个无公共边圈的有根平面地图计数 |
| |
| 引用本文： | 李赵祥,刘彦佩.至多有两个无公共边圈的有根平面地图计数[J].应用数学与计算数学学报,2000,14(1):55-62. |
| |
| 作者姓名： | 李赵祥 刘彦佩 |
| |
| 作者单位： | 北方交通大学数学系,北京,100044 |
| |
| 基金项目： | 国家自然科学基金资助,批准号19831080. |
| |
| 摘 要： | 本文研究至多有两个无公共边圈的有根平面地图，提出了这种地图的节点剖分计数函数和以它的根次、边数和一次点数为三个参数的计数函数所满足方程。
|
| 关 键 词： | 计数 拉格朗日反演 有根平面地图 节点剖分计数 公共边图 |
| 修稿时间： | 2000年4月25日 |
Enumeration of Rooted Planar Maps Having at Most Two Edge-disjoint Circuits |
| |
| ZHAOXIANG LI,YANPEI LIU.Enumeration of Rooted Planar Maps Having at Most Two Edge-disjoint Circuits[J].Communication on Applied Mathematics and Computation,2000,14(1):55-62. |
| |
| Authors: | ZHAOXIANG LI YANPEI LIU |
| |
| Abstract: | In this paper, the rooted planar maps which have at most two edge-disjoint circuits are invetigated. An equation of enufunction with vertex partition for such maps is provided. And an equation of enufunction with three parameters: valency of root-vertex. number of edges and number of one valency is presented as well. |
| |
| Keywords: | Map Enumeration Lagrangian inversion l |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
