扇图在曲面上嵌入的分类

图在曲面上嵌入的分类就是确定图在同一曲面上(不等价的)嵌入的数目.本文,利用刘彦佩提出的嵌入的联树模型,得到了双极图与扇图的关联曲面之间的关系,进而由已知结论的双极图的亏格分布和完全亏格分布推导出扇图的亏格分布和完全亏格分布,并给出了扇图在亏格为1-4的不可定向曲面上嵌入的个数的显式.     

K_(1,4)梯图的可定向嵌入亏格分布

本文主要运用刘彦佩提出的联树嵌入法研究一类新图-K_(1,4)梯图W_n的可定向嵌入亏格分布,并通过进一步递推化简,得到了K_(1,4)梯图在小亏格上的嵌入亏格多项式显式,以及在其他亏格上的简单递推式,使其在可定向亏格上的嵌入个数更容易地得出.     

多重闭梯图在曲面上嵌入的分类

利用刘彦佩提出的嵌入的联树模型,得到了二重闭梯图在可定向曲面上的亏格分布的一个递推关系,并进一步给出了多重闭梯图在射影平面上的嵌入个数.     

曲面上图的拉普拉斯谱半径

本文研究了图嵌入到给定紧致曲面上的拉普拉斯谱半径,确定了将顶点数为n、最大度为△的图分别嵌入到亏格为g的定向曲面和亏格为h的不可定向曲面上的新上界.     

类圈图的亏格分布

一个图 G 的亏格分布是指序列{g_k}, g_k表示 G 嵌入亏格为 k 的闭的可定向曲面的数目. 该文给出了标准类圈图的亏格分布的递推公式, 并得到类圈图的嵌入多项式的计算公式.     

类循环图的可定向嵌入北大核心CSCD

陈仪朝等运用覆盖矩阵和Chebyshev多项式计算了一些图类在曲面上的亏格分布,本文给出了一类不能运用Chebyshev多项式的类循环图,计算出它在可定向曲面上的嵌入.     

叉梯有向图在可定向曲面上的亏格多项式

虽然一些关于图的亏格分布的结果已经知道,但关于有向图的结果却很少.本文第二作者发现了计算图的嵌入多项式的联树法,这篇文章将此方法推广到计算有向图的嵌入多项式.得到了一类新的四正则叉梯有向图在可定向曲面上的亏格多项式.这些结果为解决Bonnington提出的第三个问题奠定了基础.     

图的最大亏格的一个性质

本文所考虑的图均指有限元向图，没有解释的术语和记号同[1]．一个图称为简单图如果不含重边及环．曲面S这里指一个紧的，连通的，2－维闭流形（定向或不可定向），其亏格记为g（S）．连通图G在曲面S上的一个2－胞腔嵌入意指存在一个1－1连续映射h：G→S使得S＼h（G）的每个连通分支与圆盘拓扑同胚．连通图G的定向亏格γ（G）（或不可定向亏格γ（G））是指最小的整数k使得G在亏格为k的定向（或不可走向）曲面S上有2－胞腔嵌入；而图G的最大定向亏格，也常称之为最大亏格，记为γM（G）,是指最大的整数k使得G在亏格为k定向曲面S上有…     

灯笼图的可定向嵌入亏格分布

本文主要利用联树法研究了图的亏格多项式,得到了一类新图(灯笼图)的嵌入亏格分布.证明了灯笼图和偶梯图的亏格分布具有相同的递推关系,从而得到了灯笼图的嵌入亏格分布的精确解.     

一类循环图在射影平面上的嵌入北大核心CSCD

嵌入的联树模型是研究图的曲面嵌入的一种有效方法,尤其能方便快捷地研究图在球面,环面,射影平面,Klein瓶上的嵌入。此方法通过合理选择生成树,得到联树和关联曲面,然后对关联曲面进行计数,计算出图在曲面上的嵌入个数.本文利用嵌入的联树模型得出了循环图C(2n+1,2)(n>2)在射影平面上的嵌入个数.     

The genus polynomials of cross-ladder digraphs in orientable surfaces

Some results about the genus distributions of graphs are known,but little is known about those of digraphs.In this paper,the method of joint trees initiated by Liu is generalized to compute the embedding genus distributions of digraphs in orientable surfaces.The genus polynomials for a new kind of 4-regular digraphs called the cross-ladders in orientable surfaces are obtained.These results are close to solving the third problem given by Bonnington et al.     

The Total Embedding Distributions of Cacti and Necklaces

Total embedding distributions have been known for only a few classes of graphs. In this paper the total embedding distributions of the cacti and the necklaces are obtained. Furthermore we obtain the total embedding distributions of all graphs with maximum genus 1 by using the method of this paper.     

STRONG EMBEDDINGS OF PLANAR GRAPHS ON HIGHER SURFACES

In this paper, the authors discuss the upper bound for the genus of strong embeddings for 3-connected planar graphs on higher surfaces. It is shown that the problem of determining the upper bound for the strong embedding of 3-connected planar near-triangulations on higher non-orientable surfaces is NP-hard. As a corollary, a theorem of Richter, Seymour and Siran about the strong embedding of 3-connected planar graphs is generalized to orientable surface.     

不可定向曲面上的最大亏格嵌入和最小亏格嵌入

研究了不可定向曲面上最大亏格嵌入的估计数,得到了几类图的指数级不可定向最大亏格嵌入的估计数的下界.利用电流图理论,证明了完全图K_(12s)在不可定向曲面上至少有2~(3s-1)个最小亏格嵌入;完全图K_(12s+3)在不可定向曲面上至少有2~(2s)个最小亏格嵌入;完全图K_(12s+7)在不可定向曲面上至少有2~(2s+1)个最小亏格嵌入.     

On the genus distributions of wheels and of related graphs

We are concerned with families of graphs in which there is a single root-vertex ofunbounded valence, and in which, however, there is a uniform upper bound for the valences of all the other vertices. Using a result of Zagier, we obtain formulas and recursions for the genus distributions of several such families, including the wheel graphs. We show that the region distribution of a wheel graph is approximately proportional to the sequence of Stirling numbers of the first kind. Stahl has previously obtained such a result for embeddings in surfaces whose genus is relatively near to the maximum genus. Here, we generalize Stahl’s result to the entire genus distributions of wheels. Moreover, we derive the genus distributions for four other graph families that have some similarities to wheels.     

Développements récents de la théorie des graphies

Stimulated by its numerous applications, the theory of graphs continuously progresses in various domains. The concept of graph in itself varies in accordance with authors and problems considered: it belongs to the logic of sets as well as to combinatorial topology. Questions may be grouped into three main classes: the study of characteristic properties (invariants such as connectivity, existence of Hamiltonian circuits, Ramsey numbers); problems of embedding on surfaces (planarity, genus, thickness) and of graph-coloring; and enumeration of given classes of graphs, a peculiarly difficult field of investigation. Hypergraphs present a generalization of graphs from a set theoretic point of view. In spite of its rapid growth, graph theory has not yet reached its deep unity.     

Embedding Distributions and Chebyshev Polynomials

The history of genus distributions began with J. Gross et?al. in 1980s. Since then, a lot of study has given to this parameter, and the explicit formulas are obtained for various kinds of graphs. In this paper, we find a new usage of Chebyshev polynomials in the study of genus distribution, using the overlap matrix, we obtain homogeneous recurrence relation for rank distribution polynomial, which can be solved in terms of Chebyshev polynomials of the second kind. The method here can find explicit formula for embedding distribution of some other graphs. As an application, the well known genus distributions of closed-end ladders and cobblestone paths (Furst et?al. in J Combin Ser B 46:22–36, 1989) are derived. The explicit formula for non-orientable embedding distributions of closed-end ladders and cobblestone paths are also obtained.     

The embeddings of a graph—A survey

Topological graph theory seeks to find answers to the question of how graphs map into surfaces. This paper surveys the information now available about the range of a graph, namely, the set of surfaces on which the graph can be “neatly” embedded. Several other closely related topics, such as irreducible graphs, coloring problems, and crossing numbers, are ignored. As is quite often the case with mathematical theories, this discipline developed in a rather haphazard manner. Many isolated results existed before the practitioners became aware of the fact that they were developing a theory. The turning point occurred in 1968, when Ringel and Youngs completed their proof of the Heawood conjecture. Their proof, in addition to settling an old unsolved problem, also reinforced the significance of the rotation systems. It is the author's belief that these rotation systems, together with the generalized embedding schemes can, and should, become the main tool in all investigations concerning the embeddings of a graph. This survey is written from that point of view. After defining the scope of the area surveyed, this paper proceeds to discuss the significance of the rotation systems and embedding schemes. Several theorems of a general nature are listed. Attention is then focused on the maximum and minimum genera of a graph. Discussion of the first of these is deferred to another survey article by R. Ringeisen to appear in a subsequent issue. The various methods developed by researchers in this area for determining the (minimum) genus are then described. This is followed by a listing of all the theoretical information that is available about the genus parameter. The paper includes two tables that exhibit most of the graphs with known genus.     

Weak embedding of planar graphs

A weak embedding of a graphG is an embedding ofG with all the faces being tours. In this paper, for some planar graphs the weak maximum genus of them are given. And for the planar graphG, a characterization of whetherG can be weakly embedded on the nonspherical surfaces is obtained.