一个关于球面和环面上嵌入图的近-三角剖分嵌入的内插定理(I)

一个近-三角剖分嵌入是指一个曲面上的嵌入图使得几乎所有的面都是三角形,至多只有一个可能的例外.文中作者证明了如下结论:如果一个图G 在球面S₀(或环面S₁)上有近-三角剖分嵌入,那么G在每一个可定向曲面S_k有近-三角剖分嵌入,其中k=h,h+1,\cdots ,\lfloor\frac{\beta(G)}{2}\rfloor$, 而h=0(或1)并且β(G)是图G的Betti数.特别地,G是上可嵌入的.     

多重圈梯图在射影平面上的嵌入个数

图在不同亏格曲面上的嵌入个数常常有相关关系,因此,分析一些图类在小亏格曲面上的嵌入个数对最终确定图的亏格分布和完全亏格分布有着重要意义,本文利用嵌入的联树模型得出了多重圈梯图在射影平面上的嵌入个数.     

两类四正则图的完全亏格分布

一个图G的完全亏格多项式表征了图G的亏格(可定向,不可定向)分布情况.本文利用刘彦佩提出的嵌入的联树模型,得出了两类新的四正则图的完全亏格多项式,并推导出已有结果的两类图的完全亏格多项式.此处的结果形式更为简单.     

两类广义Petersen 图的Euler亏格

广义 Petersen 图 P(n, m) 是这样的一个图:它的顶点集是{u_i, v_i | i=0,1, ^… , n-1}, 边集是 {u_iu_i+1, v_iv_i+m, u_iv_i | i=0,1, ^…, n-1}, 这里 m, n 是正整数、加法是在模n 下且 m<|n/2| . 这篇文章证明了P(2m+1, m)(m≥ 2) 的 Euler 亏格是1, 并且 P(2m+2, m)(m≥ 5) 的 Euler 亏格是2.     

圈梯形图序列的嵌入

本文主要研究确定圈梯形图序列和莫比乌斯梯形图序列(由梯形图类生成的图)的亏格分布.首先利用运算矩阵讨论梯形图类的亏格分布,然后利用加边规则,在梯形图类上加边,得到圈梯形图序列或莫比乌斯梯形图序列,进而得到圈梯形图序列(莫比乌斯梯形图序列)的亏格分布.另外,还验证了经典梯图亏格分布的渐近正态性.     

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

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

扇图在曲面上嵌入的分类

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

含故障点的加强超立方体中路和圈的嵌入

本文研究了含故障点的n-维加强超立方体Q_n,k中的路和圈嵌入的问题.充分分析了加强超立方体网络的潜在特性,利用了构造的方法.得到了含2n-4个故障点的加强超立方体Q_n,k中含长为2ⁿ-2f的容错圈的结论,推广了折叠超立方体网络中1-点容错圈嵌入的结果.其中折叠超立方体网络为加强超立方体网络的一种特殊情况.     

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

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

k-临界2k-连通图

图G 称为(n, k)-图, 如果对任一SÍ V(G) (|S|≤k)有k(G-S)=n-|S|, 其中k(G)表示G的连通度. Mader猜想当k≥3时K_2k+2-(1-因子)是惟一的(2k, k)-图. M. Kriesell 解决了k = 3, 4的特殊情形. 对k≥5的一般情形, 证明了该猜想成立.     

There is a Group of Every Strong Symmetric Genus

Let G be a finite group. The strong symmetric genus ⁰(G) isthe minimum genus of any Riemann surface on which G acts, preservingorientation. For any non-negative integer g, there is at leastone group of strong symmetric genus g. For g2, one such grouphas the form Z_k x D_n for some k and n. 2000 Mathematics SubjectClassification 57M60 (primary), 20H10, 30F99 (secondary).     

Counting hyperelliptic curves

We find a closed formula for the number hyp(g) of hyperelliptic curves of genus g over a finite field k=Fq of odd characteristic. These numbers hyp(g) are expressed as a polynomial in q with integer coefficients that depend on g and the set of divisors of q−1 and q+1. As a by-product we obtain a closed formula for the number of self-dual curves of genus g. A hyperelliptic curve is defined to be self-dual if it is k-isomorphic to its own hyperelliptic twist.     

Vertex Coverings by Coloured Induced Graphs—Frames and Umbrellas

A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if for every vertex y of H there is an induced copy of G in H containing y. For positive integer k, let f_k(G) (respectively, g_k(G)) be the minimum order of a graph H whose edges can be k-coloured such that for each colour, G homogeneously embeds (respectively, uniformly embeds) in the graph given by V(H) and the edges of that colour. We investigate the values f₂(G) and g₂(G) for special classes of G, in particular when G is a star or balanced complete bipartite graph. Then we investigate f_k(G) and g_k(G) when k ≥ 3 and G is a complete graph.     

The maximum interval number of graphs with given genus

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investigate the maximum value of the interval number for graphs with higher genus and show that the maximum value of the interval number of graphs with genus g is between ?√g? and 3 + ?√3g?. We also show that the maximum arboricity of graphs with genus g is either 1 + ?√3g? or 2 + ?√3g?.     

Cohomology Actions and Centralisers in Unitary Reflection Groups

In an earlier work, the second author proved a general formulafor the equivariant Poincaré polynomial of a linear transformationg which normalises a unitary reflection group G, acting on thecohomology of the corresponding hyperplane complement. Thisformula involves a certain function (called a Z-function below)on the centraliser CG(g), which was proved to exist only incertain cases, for example, when g is a reflection, or is G-regular,or when the centraliser is cyclic. In this work we prove theexistence of Z-functions in full generality. Applications includereduction and product formulae for the equivariant Poincarépolynomials. The method is to study the poset L(C_G(g)) of subspaceswhich are fixed points of elements of C_G(g). We show that thisposet has Euler characteristic 1, which is the key propertyrequired for the definition of a Z-function. The fact aboutthe Euler characteristic in turn follows from the ‘join-atom’property of L(C_G(g)), which asserts that if [X₁,..., X_k} isany set of elements of L(C_G(g)) which are maximal (set theoretically)then their setwise intersection lies in L(C_G(g)). 2000 Mathematical Subject Classification:primary 14R20, 55R80; secondary 20C33, 20G40.     

A relative maximum genus graph embedding and its local maximum genus

A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph is the maximum of integerk with the property that the graph has a relative embedding in the orientable surface withk handles. A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph if the relative tree of the graph is planar. Under this condition, just like maximum genus embedding, a graph does not have any locally strict maximum genus.     

图的不可定向最大亏格

本文证明了:对于任何一个有圈连通图G,其不可定向最大亏格为这里,α₀,α₁分别为G的顶点和边的数目.从而,也解决了图的不可定向嵌入的存在性问题.     

Cayley Cages

A (k,g)-Cayley cage is a k-regular Cayley graph of girth g and smallest possible order. We present an explicit construction of (k,g)-Cayley graphs for all parameters k≥2 and g≥3 and generalize this construction to show that many well-known small k-regular graphs of girth g can be constructed in this way. We also establish connections between this construction and topological graph theory, and address the question of the order of (k,g)-Cayley cages.