摘要
这篇文章得到了有根平面树的节点剖分的色和方程.导出了带无限多个参数的有根平面植树和平面树的色和方程的精确表达式.作为直接推论可推出节点剖分的有根平面树的计数方程的精确结果.
In this paper, the chromatic sum equation of rooted planar trees with vertex partition is obtained. The explicit expressions of chromatic sum equations for rooted planted trees and planar trees with infinitive parameters are derived respectively. Furthermore, the explicit result of enumerating function of rooted planar trees with vertex partition is gotten as a directly corollary.
出处
《数学物理学报(A辑)》
CSCD
北大核心
2005年第3期404-408,共5页
Acta Mathematica Scientia
基金
国家自然科学基金(NNSFC10271017
NNSFC10271048
NNSFC60373030)
北京交通大学校基金(2004SM054)资助
关键词
地图
色和方程
树
Map
Chromatic sum equation
Tree.