共查询到20条相似文献,搜索用时 46 毫秒
1.
提供了根点为一个奇点的带根单行平面地图以其边数、根点次和非根奇点次为参数的生成函数所满足的一些函数方程,并且导出了这些函数的显式,它们有两个是无和式. 相似文献
2.
3.
THE NUMBER OF ROOTED NEARLY CUBIC C-NETS 总被引:2,自引:0,他引:2
1. IntroductionW.T. Tutte's original papers[1--3) on the enumerative theory of rooted planar maps havebrought forth a series of papers on enumerating triangulations. The enumeration of generalrooted planar maps has then also been investigated and a number of elegant results havebeen obtained, although relatively fewer than that of triangulations. As the dual case oftriangulations, the enumerative theory of cubic maps has also been developed, though thereare a lot of problems waiting for solut… 相似文献
4.
5.
6.
In this paper, we study the rooted nonseparable maps on the sphere and the projective plane with the valency of root-face and the number of edges as parameters. Explicit expression of enumerating functions are obtained for such maps on the sphere and the projective plane. A parametric expression of the generating function is obtained for such maps on the projective plane, from which asymptotic evaluations are derived. Moreover, if the number of edges is sufficiently large, then almost all nonseparable maps on the projective plane are not triangulation. 相似文献
7.
Stack words stem from studies on stack-sortable permutations and represent classical combinatorial objects such as standard Young tableaux, permutations with forbidden sequences and planar maps. We extend existing enumerative results on stack words and we also obtain new results. In particular, we make a correspondence between nonseparable 3×n rectangular standard Young tableaux (or stack words where elements satisfy a ‘Towers of Hanoi’ condition) and nonseparable cubic rooted planar maps with 2n vertices enumerated by 2n(3n)!/((2n+1)!(n+1)!). Moreover, these tableaux without two consecutive integers in the same row are in bijection with nonseparable rooted planar maps with n+1 edges enumerated by 2(3n)!/((2n+1)!(n+1)!). 相似文献
8.
This paper provides the parametric expressions satisfied by the enumerating functions for rooted nearly cubicc-nets with the size and/or the root-vertex valency of the maps as the parameters via nonseparable nearly cubic maps. On this
basis, two explicit expressions of the functions can be derived by employing Lagrangian inversion.
This Research is supported by National Natural Science Foundation of China (No. 19831080). 相似文献
9.
In this paper, the chromatic sum functions of rooted biloopless nonseparable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. An asymptotic evaluation and some explicit expression of enumerating functions are also derived. 相似文献
10.
Chromatic sum equations for rooted cubic planar maps 总被引:4,自引:0,他引:4
Yanpei Liu 《应用数学学报(英文版)》1987,3(2):136-167
This paper provides a functional equation satisfied by rooted nearly cubic planar maps. By a nearly cubic map is meant such a map that all the vertices have valency 3 with the exception of at most the root-vertex. And, as a consequence, the corresponding functional equation for rooted cubic planar maps is found. 相似文献
11.
Liu Yanpei 《数学年刊B辑(英文版)》1990,11(4):491-502
Let G(m, s, t; \lambda)be the number of ways of \lambda-coloring all the rooted nonseparable outerplanar maps which are simple and have the edge number m, the valency s of the root-face, and the valency t of the root-vertex. The chromatic enumerating, function
$g(x,y,z;\lambda)=\sum\limits_{m\geq 1,s\geq 2,t\geq 2}{G(m,s,t;\lambda)x^my^sz^t$
is determined. Meanwhile, a number of explicit formulae for enumerating this kindof maps in general case and in bipartite ease are provided. 相似文献
12.
ENUMERATING ROOTED EULERIAN PLANAR MAPS 总被引:2,自引:0,他引:2
1 IntroductionSince Thtte's papers oll enunlerating planar InaPs in [7,8] published iu the beginlling Ofsixties, the enumerative theory has been developed greatly up to now. The enumeration ofgenera1 Eulerian planar maps is dependent on two paranleters as the valency of rooted vertexalld the uunther of edges Of the nmps. Y.P.Liu found tl1e functional equation firstly for thenlaPs aud then obtained the number of general rooted Elllerian planar maPs with the nuntherof edges given in 1989[1].… 相似文献
13.
In this paper, we study the chromatic sum functions of rooted nonseparable near-triangulations on the sphere and the projective plane. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. Applying chromatic sum theory, the enumerating problem of different sorts maps can be studied, and a new method of enumeration can be obtained. Moreover, an asymptotic evaluation and some explicit expression of enumerating functions are also derived. 相似文献
14.
本文研究至多有两个无公共边圈的有根平面地图,提出了这种地图的节点剖分计数函数和以它的根次、边数和一次点数为三个参数的计数函数所满足方程。 相似文献
15.
In this paper we study the chromatic sum functions for rooted nonseparable simple maps on the plane. The chromatic sum function equation for such maps is obtained. The enumerating function equation of such maps is derived by the chromatic sum equation of such maps. From the chromatic sum equation of such maps, the enumerating function equation of rooted nonseparable simple bipartite maps on the plane is also derived. 相似文献
16.
众所周知,由于本质圈(或不可收缩圈)的作用,使得一般的曲面上要得到带有两到三个参数的地图计算公式(尤其是显式公式)变得十分困难。该文集中讨论射影平面上不可分近三角剖分地图的计算。通过引入含有面次,边数和内部面数的参数表达式与Lagrangian反演,作者得到了含有正项系数的显式公式用以计算射影平面上三角剖分地图 。 相似文献
17.
In 1966, Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for studying some graph-theoretic properties. In this paper, we study some enumerative properties of circuit graphs. For enumeration purpose, we define rooted circuit maps and compare the number of rooted circuit maps with those of rooted 2-connected planar maps and rooted 3-connected planar maps. 相似文献
18.
In this paper we provide a solution of the functional equation unsolved in the paper, by the second author, "On functional equations arising from map enumerations" that appeared in Discrete Math, 123: 93-109 (1993). It is also the number of combinatorial distinct rooted general eulerian planar maps with the valency of root-vertex, the number of non-root vertices and non-root faces of the maps as three parameters. In particular, a result in the paper, by the same author, "On the number of eulerian planar map... 相似文献
19.
刘彦佩 《应用数学学报(英文版)》1989,5(2):169-175
In this paper, the number of combinatorially distinct rooted nonseparable outerplanar maps withm edges and the valency of the root-face being n is found to be(m-1)! (m-2) !:(n-1)!(n-2)! (m-n)!(m-n 1)!and, the number of rooted nonseparable outerplanar maps with m edges is also determined to be(2m-2)!:(m-1)!m!,which is just the number of distinct rooted plane trees with m-1 edges. 相似文献
20.
Didier Arques 《Journal of Combinatorial Theory, Series B》1985,39(1):27-42
A new functional relation, whose unique solution is the generating function of rooted planar maps, is shown. This new relation in conjunction with the well-known relation established by Tutte, enables the easy derivation of a system of parametric equations for the wanted generating function. As a consequence, we infer a closed formula counting the rooted planar maps as a function of their number of vertices and faces. The geometrical nature of the decomposition used in the derivation of this functional relation, leads to the definition of a natural notion of the inner map of a rooted planar map. Some questions related to this notion are treated. 相似文献