关于半传递图的若干新结果

我们称无向图Ｘ为半传递的，如果它的自同构群Ａｕｔ Ｘ在Ｘ的顶点集合以及边集合上作用是传递的，但在Ｘ的有序的相邻顶点对的集合上作用非传递。本文综述了自１９９０年以来若干数学家包括作者本人在半传递图方面研究的最新结果，特别地，我们的工到了具有本原自同构群的半传递图，从而肯定地回答了Ｈｏｌｔｏｎ问题，同时还证明了只存在一个４度２７阶的半传递图，解决了Ｈｏｌｔ问题。     

非交换单群上三度点传递双凯莱图

如果一个图Γ含有一个自同构群G使得它在顶点集V(Γ)上作用半正则且恰好有两个轨道,则称图r是群G上的双凯莱图.进一步的,如果G在全自同构群Aut(Γ)中正规,我们就称这个双凯莱图是群G上的正规双凯莱图.本文中,我们证明了绝大多数非交换单群G上的三度点传递双凯莱图都是该群上的正规双凯莱图.     

4p~2阶4度半传递图

如果图X的全自同构群Aut(X)作用在其顶点集V(X)和边集E(X)上都是传递的,但作用在弧集Arc(X)上非传递,则称X是半传递图.研究了4p~2(p3且p≡-1(mod4))阶4度半传递图,确定了4p~2阶4度半传递图的连通性及其自同构群的阶.     

一类用仿射几何构造的半对称图

图X是一个有限简单无向图,如果图X是正则的且边传递但非点传递,则称X是半对称图.主要利用仿射几何构造了一类2p~n阶连通p~4度的半对称图的无限族,其中p≥n≥11.     

一类半对称图的构造

称一个有限简单无向图X是半对称图,如果图X是正则的且边传递但非点传递.主要利用仿射几何构造了一类2p~n阶连通p~3。度的半对称图的无限族,其中p≥n≥8.     

2p~n阶连通p~2度的半对称图

称一个有限简单无向图X是半对称图,如果图X是正则的且边传递但非点传递.本文主要利用仿射几何构造了一类2p~n阶连通p~2度的半对称图的无限族,其中p≥n≥5.     

容许二维线性群作用点本原的二弧传递图

一个图称为本原的如果它的自同构群作用在点集上是本原的.在这篇文章里,我们不但完全分类了容许一类二维线性群作用点本原的2-弧传递图,而且决定了他们的自同构群,并在同构意义下决定了它们的个数.     

三度正规双凯莱图与双正规凯莱图（英文）

一个图称为群G上的凯莱图(或双凯莱图),如果它的自同构群有一个同构于G的半正则子群在图的顶点集合上作用有一个(或两个)轨道.称群G上的凯莱图或双凯莱图r是正规的,如果群G在图r的全自同构群中是正规的.称群G上的凯莱图Γ为双正规的,如果Aut(Γ)的包含在G中的极大正规子群在G中的指数为2.由定义可知,每个双正规凯莱图都是正规双凯莱图.本文给出了三度正规双凯莱图同时也是双正规凯莱图的一个刻画.作为应用,给出了2p³阶的三度非正规凯莱图的分类,这里p>3为素数.     

自同构群为Mathieu群的边本原图

一个图Γ称之为边本原图.若Γ的全自同构群作用在Γ的边集上是本原的.边本原图是一类重要的对称图,这类图不是很多,但一些著名的图,比如Heawood图,Tutte-Coxeter图和Higman-Sims图都是边本原图.我们通过构造陪集图的方法来研究边本原图,并给出了基柱为Mathieu群的几乎单群上边本原图的分类.     

群与图的对称性

首先对平面图形的对称进行分析和利用其对称群进行量化,进而将此推广到考察一般图的广义"对称性"与图自同构群的关系,最后刻画了无平方因子阶局部本原弧传递图的自同构群结构.     

Biprimitive Graphs of Smallest Order

A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these parts. A semisymmetric graph is called biprimitive if its automorphism group acts primitively on each part. In this paper biprimitive graphs of smallest order are determined.     

A classification of semisymmetric graphs of order 2pq

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper gives a classification of semisymmetric graphs of order 2pq where p and q are distinct primes. It is shown that there are 143 examples of such graphs, 131 of which are biprimitive.     

二面体群D_(2n)的4度正规Cayley图

设G是有限群,S是G的不包含单位元1的非空子集．定义群G关于S的 Cayley(有向)图X=Cay(G,S)如下:V(x)=G,E(X)={(g,sg)|g∈G,s∈S}． Cayley图X=Cay(G,S)称为正规的如果R(G)在它的全自同构群中正规．图X称为1-正则的如果它的全自同构群在它的弧集上正则作用．本文对二面体群D2n以Z22 为点稳定子的4度正规Cayley图进行了分类．     

三度边正则图的三个无限族

图X称为边正则图，若X的自同构群Aut(X)在X的边集上的作用是正则的．本文考察了三度边正则图与四度Cayley图的关系，给出了一个由四度Cayley图构造三度边正则图的方法，并且构造了边正则图的三个无限族．     

Semisymmetric cubic graphs of order 16<Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>

An undirected graph without isolated vertices is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. In this paper, we inquire the existence of connected semisymmetric cubic graphs of order 16p ². It is shown that for every odd prime p, there exists a semisymmetric cubic graph of order 16p ² and its structure is explicitly specified by giving the corresponding voltage rules generating the covering projections.     

Classifying cubic symmetric graphs of order 10p or 10p~2

A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ≥ 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results, all s-regular cubic graphs of order 10p or 10p2 are also classified for each s ≥ 1 and each prime p, of which the proof depends on the classification of finite simple groups.     

Semisymmetric graphs

Let be a regular covering projection of connected graphs with the group of covering transformations isomorphic to N. If N is an elementary abelian p-group, then the projection ℘_N is called p-elementary abelian. The projection ℘_N is vertex-transitive (edge-transitive) if some vertex-transitive (edge-transitive) subgroup of the automorphism group of X lifts along ℘_N, and semisymmetric if it is edge- but not vertex-transitive. The projection ℘_N is minimal semisymmetric if it cannot be written as a composition ℘_N=℘℘_M of two (nontrivial) regular covering projections, where ℘_M is semisymmetric.Malni? et al. [Semisymmetric elementary abelian covers of the Möbius-Kantor graph, Discrete Math. 307 (2007) 2156-2175] determined all pairwise nonisomorphic minimal semisymmetric elementary abelian regular covering projections of the Möbius-Kantor graph, the Generalized Petersen graph GP(8,3), by explicitly giving the corresponding voltage rules generating the covering projections. It was remarked at the end of the above paper that the covering graphs arising from these covering projections need not themselves be semisymmetric (a graph with regular valency is said to be semisymmetric if its automorphism group is edge- but not vertex-transitive). In this paper it is shown that all these covering graphs are indeed semisymmetric.     

Hexavalent symmetric graphs of order 9p

A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. In this paper, we classify hexavalent symmetric graphs of order $9p$ for each prime $p$.     

Tetravalent vertex‐transitive graphs of order 4p

A graph is vertex‐transitive if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs of order 4p are classified for each prime p. As a result, there are one sporadic and five infinite families of such graphs, of which the sporadic one has order 20, and one infinite family exists for every prime p>3, two families exist if and only if p≡1 (mod 8) and the other two families exist if and only if p≡1 (mod 4). For each family there is a unique graph for a given order. © 2011 Wiley Periodicals, Inc.