图的最大亏格与图的顶点划分

本文研究了图的Betti亏数与图的顶点划分的导出子图之间的关系,得到了图的最大亏格上界由其顶点划分的导出子图所表达的关系式,由此给出了图的最大亏格的一些新结果．     

A note on the maximum genus of 3-edge-connected nonsimple graphs

Let G be a 3-edge-connected graph (possibly with multiple edges or loops), and let γM(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γM(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.     

与直径和围长有关的最大亏格的下界

本文证明了如下结果:设G为直径为d的简单图,若G的围长不小于d,则当d为不小于4的偶数时,有ξ(G)≤1,即G是上可嵌入的;当d为不小于3的奇数时,有ξ(G)≤2,即γM(G)≥1/2β(G)-1.     

关于嵌入图的最大亏格

不依赖图的其它参数, 而主要依据图嵌入在定向曲面上的有关嵌入性质, 该文研究图的最大亏格.     

与直径和围长有关的图的最大亏格

利用图的直径和围长来研究图的最大亏格的下界,得到了如下结果：设G是直径为d的简单图,若G的围长不小于d（其中d为不小于3的整数）,则ξ（G）≤2,即γM（G）≥1/2β（G）-1．而且,在这种意义下,所得到的界是最好的．     

关于直径为４的图的最大亏格

该文证明了如下结果：设犌为直径为４的简单图,若犌不含３阶完全子图犓３,则犌的Ｂｅｔｔｉ亏数ξ（犌）≤４,因此有犌的最大亏格γ犕（犌）≥ １２β（犌）－２．     

关于图的最大亏格的一个定理改进

一个图G的最大亏格γM（G）主要由其参数Betti亏数ξ（G）确定．本文改进Nebesky文［5］中关于ξ（G）的一个表示定理，从而得到关于ξ（G）的一个新结果；由此，给出几个已有结果的简单证明，且其中推广文［8］中的一个结果．     

On the minimum degree,edge-connectivity and connectivity of power graphs of finite groups

In this paper, the minimum degree of power graphs of certain cyclic groups, abelian p-groups, dihedral groups and dicyclic groups are obtained. It is ascertained that the edge-connectivity and minimum degree of power graphs are equal, and consequently, the minimum disconnecting sets of power graphs of the aforementioned groups are determined. In order to investigate the equality of connectivity and minimum degree of power graphs, certain necessary conditions for finite groups and a necessary and su?cient condition for finite cyclic groups are obtained. Moreover, the equality is discussed for the power graphs of abelian p-groups, dihedral groups and dicyclic groups.     

双向2 重迹与图的最大亏格

设G为连通图且L是G的一条双向2 重迹. 作者引入G的一个新参数, 称之为G的反射数,并用ε(G)表示. 反射数ε(G)由如下式子给出:ε(G)=min〖DD(X〗L〖DD)〗ε(G, L), 这里ε(G, L)是G的关于L的反射数,且“min”取遍G的所有双向2 重迹L然后, 对于3 正则图G, 作者证明了G的反射数ε(G)与G的最大亏格γ\-M(G)密切相关,具体地, ε(G)=2γ\-M(G)-β(G), 其中β(G)是G的圈秩数. 同时, 作者给出一个与ε(G)的值有关的G的特征结构. 这些可视为Thomassen C的有关结果的进一步补充.     

MAXIMUM GENUS, INDEPENDENCE NUMBER AND GIRTH

1.IntroductionThegraphconsideredhereisconnectedandsimpleunlessstatedotherwise.Forterminologyandnotationwithoutexplanation,wereferto[l].Inthispaperwestudythemaximumgenusofagraph,aninvariancethatcharacterizesthegraphcellularlyembeddedinanorielltablesurface.Recallthatthemaximumgenussdenotedby7M(G),ofthegraphGisthemaximumintegernumberkwiththepropertythatthereexistsacellularembeddingofGontheorientablesurfaceSofgenusk.TheEulerpolyhedralequationshowsthatthemaximumgenusofanygraphGsatisfiesthefollo…     

图的最大亏损及围长

图的最大亏损主要由其参数Ｂｅｔｔｉ亏数确定（例如,见［３］）．本文给出了由图的独立数及围长所确定的Ｂｅｔｔｉ亏数的一个最好上界 ,从而即可得到关于图的最大亏格的一个新结果．     

一类3-连通图的上可嵌入性

结合图的k-边形2-因子条件，确定了一类上可嵌入的3-连通图。     

与直径和围长有关的最大亏格的下界的一个注记

改正了文章"与直径和围长有关的最大亏格的下界(数学学报2004,47(6):1201-1204)"中的一个错误结论,并得到了如下结果:设G是直径为d(G)的简单图,若G的围长g(G)■d(G),则ξ(G)■2,从而γM(G)■(1/2)β(G)-1.     

与顶点A-划分有关的上可嵌入图类

图G的顶点A-划分是指:G的顶点集划分{V1,V2,···,Vs},其中G[Vi](1≤i≤s)为多重完全图或多重完全二部图.文中结合图的顶点A-划分,顶点度及边连通性等条件确定了一些新的上可嵌入图类,从而将已有类似结果进行了推广,且完整地刻画了这类图的上可嵌入性情况.     

Maximum principle at infinity for complete minimal surfaces in flat 3-manifolds

The main result of this paper is the following maximum principle at infinity:Theorem.Let M ₁ and M ₂ be two disjoint properly embedded complete minimal surfaces with nonempty boundaries, that are stable in a complete flat 3-manifold. Then dist(M ₁,M ₂)=min(dist(M ₁,M ₂), dist(M ₂,M ₁)).In case one boundary is empty, e.g. M ₁,then dist(M ₁,M ₂)=dist(M ₂,M ₁).If both boundaries are empty, then M ₁ and M ₂ are flat.     

图的最大亏格与重图上的有向Euler闭迹

设G为图,利用G的（有向）2－重图GG上的有向Euler闭迹,本文给出了G的最大亏格的主要决定量－Betti亏数的一个新表达式,这与文献[3]和[6]中所给出的表达式完全不同。     

Maximum vertex and face degree of oblique graphs

Let G=(V,E,F) be a 3-connected simple graph imbedded into a surface S with vertex set V, edge set E and face set F. A face α is an 〈a₁,a₂,…,a_k〉-face if α is a k-gon and the degrees of the vertices incident with α in the cyclic order are a₁,a₂,…,a_k. The lexicographic minimum 〈b₁,b₂,…,b_k〉 such that α is a 〈b₁,b₂,…,b_k〉-face is called the type of α.Let z be an integer. We consider z-oblique graphs, i.e. such graphs that the number of faces of each type is at most z. We show an upper bound for the maximum vertex degree of any z-oblique graph imbedded into a given surface. Moreover, an upper bound for the maximum face degree is presented. We also show that there are only finitely many oblique graphs imbedded into non-orientable surfaces.     

关于图的最大亏格的下界

主要考虑2-边和3-边连通图的最大亏格下界情形,推广了J.Chen等(1996)的主要结果,证明了     

Connectivity keeping edges in graphs with large minimum degree

The old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G−v is still k-connected. In this paper, we consider a generalization of the above result [G. Chartrand, A. Kaigars, D.R. Lick, Critically n-connected graphs, Proc. Amer. Math. Soc. 32 (1972) 63–68]. We prove the following result:Suppose G is a k-connected graph with minimum degree at least 3k/2+2. Then G has an edge e such that G−V(e) is still k-connected.The bound on the minimum degree is essentially best possible.     

Maximum average degree and relaxed coloring

We say a graph is $(d,d,\dots ,d,0,\dots ,0)$-colorable with $a$ of $d$’s and $b$ of $0$’s if $V\left(G\right)$ may be partitioned into $b$ independent sets $O_1,O_2,\dots ,O_b$ and $a$ sets $D_1,D_2,\dots ,D_a$ whose induced graphs have maximum degree at most $d$. The maximum average degree, $mad\left(G\right)$, of a graph $G$ is the maximum average degree over all subgraphs of $G$. In this note, for nonnegative integers $a,b$, we show that if $mad\left(G\right)<\frac{4}{3}a+b$, then $G$ is $(1_1,1_2,\dots ,1_a,0_1,\dots ,0_b)$-colorable.