摘要
本文研究至多有两个无公共边圈的有根平面地图，提供了这种地图的节点剖分计数函数和以它的根次。
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.
出处
《应用数学与计算数学学报》
2000年第1期55-62,共8页
Communication on Applied Mathematics and Computation
基金
国家自然科学基金资助!批准号19831080
