关于Thompson猜想与AAM猜想

本文研究了有限(几乎)单群的非交换图刻画问题.利用有限几乎单群的阶分量理论,证明了对于具有非连通素图的有限单群,AAM猜想成立,同时也证明了某砦几乎单群也能被其非交换图刻画.上述结果推广了文献f131的结果.

Abstract：

In this article,we discuss the characterization of some finite(almost)simple groups by their non-commuting graphs.By using the theory of order components of finite almost simple groups,we prove that AAM's conjecture is true for all finite simple groups with non-connected prime graphs.Moreover,we prove that some almost simple groups can be also characterized by their non-commuting graphs.All the above results generalize those results in[13].     

On nonabelian simple groups having the same prime graph as an alternating group

All instances of coincidence between the prime graphs of nonabelian simple groups G and S are found, where G is an alternating group of degree n ≥ 5 and S is a nonabelian finite simple group. The precise bound of the maximal number of pairwise nonisomorphic nonabelian simple groups with the same prime graph is given in the case that one of these groups is an alternating group.     

On locally primitive Cayley graphs of finite simple groups

In this paper we investigate locally primitive Cayley graphs of finite nonabelian simple groups. First, we prove that, for any valency d for which the Weiss conjecture holds (for example, d?20 or d is a prime number by Conder, Li and Praeger (2000) [1]), there exists a finite list of groups such that if G is a finite nonabelian simple group not in this list, then every locally primitive Cayley graph of valency d on G is normal. Next we construct an infinite family of p-valent non-normal locally primitive Cayley graph of the alternating group for all prime p?5. Finally, we consider locally primitive Cayley graphs of finite simple groups with valency 5 and determine all possible candidates of finite nonabelian simple groups G such that the Cayley graph Cay(G,S) might be non-normal.     

Finite groups whose character degree graphs coincide with their prime graphs

In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character degree graphs are disconnected and coincide with their prime graphs. As a corollary, we find all finite groups whose character degree graphs are square and coincide with their prime graphs.     

2p2阶3度Cayley图

Cayley图Cay(G,S)称之为正规的,如果G的右正则表示是Cay(G,S)全自同构群的正规子群。本文决定了2p~2(p为素数)阶群上3度连通Cayley图的正规性,作为该结果的一个应用,对每一个1(?)s(?)5,对2p~2阶3度s-正则Cayley图作了分类。     

Characterizations of the simple group {^2D_n(3)} by prime graph and spectrum

In this paper, we prove that there exists an infinite series of finite simple groups of Lie type with connected prime graphs which are uniquely determined by their prime graphs. More precisely, we show that every finite group G with the same prime graph as ${{}^2D_{n}(3)}$ , where n ≥ 5 is odd, is necessarily isomorphic to the group ${{}^2D_{n}(3)}$ . In fact, we give a positive answer to an open problem that arose in Zavarnitsine (Algebra Logic 45(4):220–231, 2006). As a consequence of our result, we obtain that the simple group ${{}^2D_n(3)}$ , where n is an odd number, is characterizable by its spectrum.     

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.     

Recognition of the groups <Emphasis Type="Italic">E</Emphasis><Subscript>7</Subscript>(2) and <Emphasis Type="Italic">E</Emphasis><Subscript>7</Subscript>(3) by prime graph

It is proved that the groups E ₇(2) and E ₇(3) are recognizable by their prime graphs. As a corollary, this completes the proof of V.D. Mazurov’s conjecture that every finite simple group whose prime graph has at least three connected components is either recognizable by spectrum or isomorphic to A ₆.     

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

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

一类半对称图的构造

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

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

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

Arc-Transitive Graphs of Square-free Order with Valency 11

In this paper,we present a complete list of connected arc-transitive graphs of square-free order with valency 11.The list includes the complete bipartite graph K11,11,the normal Cayley graphs of dihedral groups and the graphs associated with the simple group J1 and PSL(2,p),where p is a prime.     

Some remarks on symmetrical extensions of graphs

It is proved that results from a previous paper of the author on symmetrical 2-extensions of graphs can be extended to symmetrical p-extensions of graphs for any prime p. In particular, it is proved that, for any prime p, there are only finitely many symmetrical p-extensions of a locally finite graph with an abelian subgroup of finite index in its automorphism group. Some refinements of these results are also obtained. In addition, we consider the question on the possibility to represent symmetrical extensions of a d-dimensional grid (and similar graphs) in the d-dimensional affine Euclidean space in such a way that a corresponding vertex-transitive group of automorphisms of the extension is induced by some crystallographic group of motions of the space.     

A class of finite groups with complete character degree graphs

In this paper, we construct a new class of finite groups whose common divisor graphs are complete graphs, while there is no prime dividing all the nontrivial degrees.     

Cartesian products of directed graphs with loops

We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the factorization can be computed in linear time and space.     

3p阶亚循环群的连通4度Cayley图

研究3p阶(p是大于3的素数)亚循环群的连通4度Cayley图.主要决定了其全自同构群的结构,并由此得到这类图的CI性、正规性和弧传递性.用到单群分类定理.     

Locally Transitive Graphs Admitting a Group with Cyclic Sylow Subgroups

All graphs are finite simple undirected and of no isolated vertices in this paper. Using the theory of coset graphs and permutation groups, it is completed that a classification of locally transitive graphs admitting a non-Abelian group with cyclic Sylow subgroups. They are either the union of the family of arc-transitive graphs, or the union of the family of bipartite edge-transitive graphs.     

Relative difference sets fixed by inversion and Cayley graphs

Using graph theoretical technique, we present a construction of a (30,2,29,14)-relative difference set fixed by inversion in the smallest finite simple group—the alternating group A₅. To our knowledge this is the first example known of relative difference sets in the finite simple groups with a non-trivial forbidden subgroup. A connection is then established between some relative difference sets fixed by inversion and certain antipodal distance-regular Cayley graphs. With the connection, several families of antipodal distance-regular Cayley graphs which are coverings of complete graphs are presented.     

Self-complementary symmetric graphs

The class of self-complementary symmetric graphs is characterized using the classification of finite simple group.