共查询到20条相似文献,搜索用时 437 毫秒
1.
In this article the rooted planar near-4-regular Eulerian trails are enumerated and an explicit formula for such maps is presented. Further, the rooted near-4-regular Eulerian maps on the torus are counted in an exact way. 相似文献
2.
RenHan LiuYanpei 《高校应用数学学报(英文版)》1999,14(3):245-250
In this article the rooted planar near-4-regular Eulerian trails are enumerated and an explicit formula for such maps is presented. Further, the rooted near-4-regular Eulerian maps on the torus are counted in an exact way. 相似文献
3.
A map is 4-regular unicursal if all its vertices are 4-valent except two odd-valent vertices. This paper investigates the number of rooted 4-regular unicursal planar maps and presents some formulae for such maps with four parameters: the number of edges, the number of inner faces and the valencies of the two odd vertices. 相似文献
4.
数有根近2-正则平面地图 总被引:2,自引:0,他引:2
The number of rooted nearly 2-regular maps with the valency of root-vertex, the number of non-rooted vertices and the valency of root-face as three parameters is obtained. Furthermore, the explicit expressions of the special cases including loopless nearly 2-regular maps and simple nearly 2-regular maps in terms of the above three parameters are derived. 相似文献
5.
6.
A map is bisingular if each edge is either a loop or an isthmus (i.e., on the boundary of the same face). In this paper we study the number of rooted bisingular maps on the sphere and the torus, and we also present formula for such maps with four parameters: the root-valency,the number of isthmus, the number of planar loops and the number of essential loops. 相似文献
7.
这篇文章得到了以根节点的次、割边的个数及环的个数为参数的双树梵和的色和方程,且导出了这类地图带以上三个参数的精确解及一些退化的情形。 相似文献
8.
The work that consists of two parts is devoted to the problem of enumerating unrooted -regular maps on the torus up to all its symmetries. We begin with enumerating near--regular rooted maps on the torus, the projective plane and the Klein bottle, as well as some special kinds of maps on the sphere: near--regular maps, maps with multiple leaves and maps with multiple root darts. For and we obtain exact analytical formulas. For larger we derive recurrence relations. Then we enumerate -regular maps on the torus up to homeomorphisms that preserve its orientation — so-called sensed maps. Using the concept of a quotient map on an orbifold we reduce this problem to enumeration of certain above-mentioned classes of rooted maps. For and we obtain closed-form expressions for the numbers of -regular sensed maps by edges. All these results will be used in the second part of the work to enumerate -regular maps on the torus up to all homeomorphisms — so-called unsensed maps. 相似文献
9.
A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps. 相似文献
10.
A map is bisingular if each edge is either a loop (This paper only considersplanar loop) or an isthmus (i.e., on the boundary of the same face). This paper studies thenumber of rooted bisingular maps on the sphere and the torus, and also presents formulaefor such maps with three parameters: the root-valency, the number of isthmus, and thenumber of planar loops. 相似文献
11.
Liu Yanpei 《数学年刊B辑(英文版)》1988,9(4):390-403
In a rooted planar map, the rooted vertex is said to be non-separable if the vertex onthe boundary of the outer face as an induced graph is not a cut-vertex. In this paper, the author derives a functional equation satisfied by the enumeratingfuuction of rooted vertex non-separable planar maps dependent on the edge number and thenumber of the edges on the outer face boundary, finds a parametric expression of itssolution, and obtains an explicit formula for the function. Particularly, the number of rooted vertex non-separable maps only replying on theedge number and that of rooted vertex non-separable tree-like maps defined in [4] accordingto the two indices, the edge number and the number of the edges on the outer face boundary,or only one index, the edge number, are also determined. 相似文献
12.
13.
V. A. Voblyi 《Mathematical Notes》2008,83(1-2):14-22
Two combinatorial identities obtained by the author are used to simplify formulas for the number of general rooted cubic planar maps, for the number of g-essential maps on surfaces of small genus, and also for rooted Eulerian maps on the projective plane. Besides, an asymptotics for the number of maps with a large number of vertices is obtained. 相似文献
14.
Gab-Byung Chae 《Discrete Mathematics》2007,307(23):2979-2992
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on methods previously developed by Read, Wormald, Palmer, and Robinson. 相似文献
15.
环面上一般有根地图的计数 总被引:1,自引:0,他引:1
这篇文章给出了环面上以内面个数,根面次和非根节点个数为参数的一般有根地图的计数方程,导出了以内面个数和非根节点个数为参数的这类地图的计数方程的精确解。作为推论,推出了以边数为参数的这类地图的个数,其近似解在文献[2]中已讨论。 相似文献
16.
17.
RenHan LiuYanpei 《高校应用数学学报(英文版)》1999,14(1):117-121
A Halin map is a kind of planar maps oriented by a tree. In this paper the rooted halin maps with the vertex partition as parameters are enumerated such that a famous result on rooted trees due to Harary. Prins, and Tutte is deduced as. a special ease. Further, by using Lagrangian inversion to obtain a number of summation free formulae dixectly, the various kinds of rooted Halin maps with up to three parameters have been counted. 相似文献
18.
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. 相似文献
19.
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. 相似文献
20.
In this paper we study the rooted loopless 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 function is 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. 相似文献