最大度不小于5的外平面图的邻强边染色

图G(V,E)的一k-正常边染色叫做k-邻强边染色当且仅当对任意uv∈E(G)有,f[u]≠f[v],其中f[u]={f(uw)|uw∈E(G)},f(uw)表示边uw的染色.并且x'as(G)=min{k|存在k-图G的邻强边染色}叫做图G的图的邻强边色数.本文证明了对最大度不小于5的外平面图有△≤x'as(G)≤△ 1,且x'as(G)=△ 1当且仅当存在相邻的最大度点.     

嵌入在克莱茵瓶上的图的最大亏格

设$\phi: G\rightarrow S$是图$G$在曲面$S$上的2 -胞腔嵌入. 若$G$的所有面都是依次相邻, 即嵌入图$G$的对偶图有哈密顿圈, 则将$\phi$称为一个面依次相邻的嵌入. 该文研究了在克莱茵瓶上有面依次相邻嵌入的图的最大亏格.     

Klein瓶上的6-正则嵌入图的着色性质

Brooks证明了:若G是连通的简单图,并且它既不是奇圈,又不是完全图,那么它的色数至多为△(G),其中△(G)为图G的最大度.它可以推出嵌入到Klein瓶上的任意的一个6-正则图的色数至多为6.通过对Klein瓶上的6-正则嵌入图的结构分析,证明了Klein瓶上的任意的一个6-正则嵌入图的色数为5.     

The 2-Extendability of Graphs on the Projective Plane, the Torus and the Klein Bottle

A graph is said to be k-extendable if any independent set of k edges extends to a perfect matching. We shall show that every 5-connected graph of even order embedded on the projective plane and every 6-connected one embedded on the torus and the Klein bottle is 2-extendable and characterize the forbidden structures for 5-connected toroidal graphs to be 2-extendable.     

不含相邻三角形的平面图的无圈边着色

An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ’ a(G).In this paper we prove that χ ’ a(G) ≤(G) + 5 for planar graphs G without adjacent triangles.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.     

An Extremal Characterization of the Incidence Graphs of Projective Planes

Let G be a 4-cycle free, bipartite graph on 2n vertices with partitions of equal cardinality n. Let c₆(G) denote the number of cycles of length 6 in G. We prove that for n 3, c₆(G) , where , with equality if and only if G is the incidence point-line graph of a projective plane.     

Caylay射影平面的全实曲面

It has been shown, under certain conditions on the Gauss curvature, every totally real surface of the Cayley projective plane with parallel mean curvature vector is either flat or totally geodesic.     

Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs

We provide some exact formulas for the projective dimension and regularity of edge ideals associated to some vertex-weighted oriented cyclic graphs with a common vertex or edge.These formulas are functions in the weight of the vertices,and the numbers of edges and cycles.Some examples show that these formulas are related to direction selection and the assumption that w(x)≥2 for any vertex x cannot be dropped.     

On Sets of Planes in Projective Spaces Intersecting Mutually in One Point

Let be a projective space. In this paper we consider sets of planes of such that any two planes of intersect in exactly one point. Our investigation will lead to a classification of these sets in most cases. There are the following two main results:- If is a set of planes of a projective space intersecting mutually in one point, then the set of intersection points spans a subspace of dimension 6. There are up to isomorphism only three sets where this dimension is 6. These sets are related to the Fano plane.- If is a set of planes of PG(d,q) intersecting mutually in one point, and if q3, 3(q²+q+1), then is either contained in a Klein quadric in PG(5,q), or is a dual partial spread in PG(4,q), or all elements of pass through a common point.     

On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations

In this article, we investigate hamiltonian cycles in plane triangulations. The aim of the article is to find the strongest possible form of Whitney's theorem about hamiltonian triangulations in terms of the decomposition tree defined by separating triangles. We will decide on the existence of nonhamiltonian triangulations with given decomposition trees for all trees except trees with exactly one vertex with degree and all other degrees at most 3. For these cases, we show that it is sufficient to decide on the existence of nonhamiltonian triangulations with decomposition tree K_{1, 4} or K_{1, 5}. We also give computational results on the size of a possible minimal nonhamiltonian triangulation with these decomposition trees.     

Integral Geometry of Real Surfaces in the Complex Projective Plane

We give a Poincaré formula for any real surfaces in the complex projective plane which states that the mean value of the intersection numbers of two real surfaces is equal to the integral of some terms of their Kähler angles.     

恰有两个主特征值的图与图的剖分

大量研究表明,图的主特征值的数量与图的结构有着密切关系.通过恰有两个主特征值的图的特征定义了2-邻域k-剖分图,研究了恰有两个主特征值的图与2-邻域k-剖分图之间的关系;同时给出一个2-邻域k-剖分图在k=2,3时为等部剖分的条件.     

Halin-图的邻强边染色

图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足f[u]≠f[v],其中,f[u]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′_as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.     

完全多部图的符号边控制数的界

$f: E(G)\rightarrow\{-1,1\}$称为图$G =(V,E)$的一个符号边控制函数 (简称SEDF),如果$f[e]=f(N[e])=\sum_{e''\in N[e]}f(e'')\geq1$对于图$G$的每条边$e\in E$都成立. $w(f)=\sum_{e\in E}f(e)$称为函数$f$的权. $G$的符号边控制数$\gamma_{s}\,''(G)$是指$G$的所有符号边控制函数的最小权.本文对完全多部图的符号边控制数进行研究.对于完全$r$-部图, 当$r$为偶数并且各部的顶点数相同的情况下,我们得到了这一参数的若干下界和上界.     

A Polyhedral Model in Euclidean 3-Space of the Six-Pentagon Map of the Projective Plane

In a private communication, Branko Grünbaum asked: “I wonder whether you know anything about the possibility of realizing as a polyhedron in Euclidean 3-space the family of six pentagons, that is a model of the projective plane arising by identifying antipodal points of the regular dodecahedron. Naturally, any realization must have some self-intersections—but is there any realization that is not completely contained in a plane?”We show that it is possible to realize this polyhedron; in our realization five of the six faces are simple polygons. In this model there are sets of three faces, which form a realization of the Möbius strip without self-intersections. There are four variants of the model. We conjecture that in any model of this polyhedron there must be at least one self-intersecting face.     

射影平面上k-inhibitor模型的构作及其性质

κ-inhibitor模型是一个能够检测带有抑制因子的群测模型,它在许多领域有着广泛的应用.在m~2阶射影平面上构作了κ-inhibitor模型,计算了它的参数并研究了它的性质.     

Edge Domination in Graphs of Cubes

The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the n-dimensional cube Q _n.     

关于图的一般邻点可区别边染色

给出了轮图W_n、扇图F_n、风车图K_2~t、图D_(m,4)、图D_(m,n)、齿轮图W_n的一般邻点可区别色指标.     

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

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