CLASSIFICATION OF PRIMITIVE （J1,2）-ARC TRANSITIVE GRAPHS

In the author＇s Ph. D thesis, a non-quasiprimitive graph admitting a quasiprimitive automorphism group isomorphic to J1 was constructed ,where J1 is Janko simple group of order 175560. Is this the only one for J1？ In this paper all primitive （J1,2）-arc transitive graphs Г are given and that AutГ≌J1 is proved.     

本原(J1,2)-弧传递图的分类

In the author's Ph. D thesis, a non-quasiprimitive graph admitting a quasiprimitive automorphism group isomorphic to J1 was constructed,where J1 is Janko simple group of order 175560.Is this the only one for J1?In this paper all primitive(J1,2)-arc transitive graphs Γ are given and that AutΓ≌J1 is proved.     

A Family of Non-quasiprimitive Graphs Constructed From PSU3（q） Where q Is Odd

Let Г be a simple connected graph and let G be a group of automorphisms of Г. Г is said to be （G, 2）-arc transitive if G is transitive on the 2-arcs of Г. It has been shown that there exists a family of non-quasiprimitive （PSU3（q）, 2）-arc transitive graphs where q = 2^3m with m an odd integer. In this paper we investigate the case where q is an odd prime power.     

Local 2-Geodesic Transitivity of Graphs

An s-geodesic in a graph Γ is a path connecting two vertices at distance s. Being locally transitive on s-geodesics is not a monotone property: if an automorphism group G of a graph Γ is locally transitive on s-geodesics, it does not follow that G is locally transitive on shorter geodesics. In this paper, we characterise all graphs that are locally transitive on 2-geodesics, but not locally transitive on 1-geodesics.     

Symmetrical path-cycle covers of a graph and polygonal graphs

A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. We introduce a method for constructing near-polygonal graphs with 2-arc transitive automorphism groups. As special cases, we obtain several new infinite families of polygonal graphs.     

A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive

The subdivision graph S(Σ) of a connected graph Σ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs Σ such that S(Σ) is locally (G, s)-distance transitive for s ≤ 2 diam(Σ) ? 1 and some G?≤ Aut(Σ). In this paper, we solve the remaining cases by classifying all the graphs Σ such that S(Σ) is locally (G, s)-distance transitive for some s?≥ 2 diam(Σ) and some G?≤ Aut(Σ). As a corollary, we get a classification of all the graphs whose subdivision graph is locally distance transitive.     

Tetravalent Edge-transitive Cayley Graphs of PGL （2, p）

t Let F = Cay（G, S）, R（G） be the right regular representation of G. The graph Г is called normal with respect to G, if R（G） is normal in the full automorphism group Aut（F） of F. Г is called a bi-normal with respect to G if R（G） is not normal in Aut（Г）, but R（G） contains a subgroup of index 2 which is normal in Aut（F）. In this paper, we prove that connected tetravalent edge-transitive Cayley graphs on PGL（2,p） are either normal or bi-normal when p ≠ 11 is a prime.     

On finite edge transitive graphs and rotary maps

It is shown that every connected vertex and edge transitive graph has a normal multicover that is a connected normal edge transitive Cayley graph. Moreover, every chiral or regular map has a normal cover that is a balanced chiral or regular Cayley map, respectively. As an application, a new family of half-transitive graphs is constructed as 2-fold covers of a family of 2-arc transitive graphs admitting Suzuki groups.     

Results on the Grundy chromatic number of graphs

Given a graph G, by a Grundy k-coloring of G we mean any proper k-vertex coloring of G such that for each two colors i and j, i<j, every vertex of G colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by Γ(G) and called Grundy (chromatic) number of G. We first discuss the fixed-parameter complexity of determining Γ(G)?k, for any fixed integer k and show that it is a polynomial time problem. But in general, Grundy number is an NP-complete problem. We show that it is NP-complete even for the complement of bipartite graphs and describe the Grundy number of these graphs in terms of the minimum edge dominating number of their complements. Next we obtain some additive Nordhaus-Gaddum-type inequalities concerning Γ(G) and Γ(G^c), for a few family of graphs. We introduce well-colored graphs, which are graphs G for which applying every greedy coloring results in a coloring of G with χ(G) colors. Equivalently G is well colored if Γ(G)=χ(G). We prove that the recognition problem of well-colored graphs is a coNP-complete problem.     

SUZUKI GROUPS Sz（q） AND 2-（v,k, 1） BLOCK DESIGNS

It is proved that if D be a 2-(v,k,1) design with G≤Aut D block primitive then G does not have a Suzuki group Sz(q) as the socle.     

Dominating direct products of graphs

An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G×H)?3γ(G)γ(H). Graphs with arbitrarily large domination numbers are constructed for which this bound is attained. Concerning the upper domination number we prove that Γ(G×H)?Γ(G)Γ(H), thus confirming a conjecture from [R. Nowakowski, D.F. Rall, Associative graph products and their independence, domination and coloring numbers, Discuss. Math. Graph Theory 16 (1996) 53-79]. Finally, for paired-domination of direct products we prove that γ_pr(G×H)?γ_pr(G)γ_pr(H) for arbitrary graphs G and H, and also present some infinite families of graphs that attain this bound.     

Locally finite classical tits chamber systems with transitive group of automorphisms in characteristic 3

The classification of locally finite classical Tits chamber systems C of finite rank admitting a transitive group G of automorphisms, such that the stabilizer in G of some chamber is finite, is now complete by work of several authors. In the following, the case, that on a rank 2 residue of C some exceptional flag-transitive subgroup of Aut(U ₄(3)) or Aut(PSp₄(3)) is induced by G, is treated.Dedicated to Professor J. Tits on the occasion of his sixtieth birthday     

The non-isolated vertices in the generating graph of a direct powers of simple groups

For a finite group G let Γ(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. Many deep results on the generation of the finite simple groups G can be equivalently stated as theorems that ensure that Γ(G) is a rich graph, with several good properties. In this paper we want to consider Γ(G ^δ ) where G is a finite non-abelian simple group and G ^δ is the largest 2-generated power of G, with the aim to investigate whether the good generation properties of G still affect the behaviour of Γ(G ^δ ). In particular we prove that the graph obtained from Γ(G ^δ ) by removing the isolated vertices is 1-arc transitive and connected and we investigate the diameter of this graph. Moreover, some intriguing open questions will be introduced and their solutions will be exemplified for $G=\operatorname{Alt}(5)$ .     

Constructions of large translation nets with nonabelian translation groups

In this paper the first infinite series of translation nets with nonabelian translation groups and a large number of parallel classes are constructed. For that purpose we investigate partial congruence partitions (PCPs) with at least one normal component.Two series correspond to partial congruence partitions containing one normal elementary abelian component. The construction results by using some basic facts about the first cohomology group of the translation group G regarded as an extension of the normal component which itself is a group of central translations.The other series correspond to partial congruence partitions containing two normal nonabelian components. The constructions are based on the well known automorphism method which leads to so-called splitting translation nets. By investigating the Suzuki groups Sz(q), the protective unitary groups PSU(3, q ²) and the Ree groups R(q) as doubly transitive permutation groups, we obtain examples of nonabelian groups admitting a large number of pairwise orthogonal fixed-point-free group automorphisms.     

F-Sets in graphs

A subset S of the vertex set of a graph G is called an F-set if every α?Γ(G), the automorphism group of G, is completely specified by specifying the images under α of all the points of S, and S has a minimum number of points. The number of points, k(G), in an F-set is an invariant of G, whose properties are studied in this paper. For a finite group Γ we define k(Γ) = max{k(G) | Γ(G) = Γ}. Graphs with a given Abelian group and given k-value (k ≤ k(Γ)) have been constructed. Graphs with a given group and k-value 1 are constructed which give simple proofs to the theorems of Frucht and Bouwer on the existence of graphs with given abstract/permutation groups.     

A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth

A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary odd girth with 2-arc transitive automorphism groups.     

kpm阶2-弧传递图

2-弧传递图是对称图类的一个重要的子类,而拟本原和双拟本原的2-弧传递图在2-弧传递图的研究中具有最基本的意义．文中对阶为kp^m（k,p是素数,k≠p,m≥2是整数)的基本2-孤传递图进行了研究。获得了下列结果：(1)kp^m阶G-拟本原的2-弧传递图是几乎单的．(2)对2p^m阶和2^mk阶双拟本原的2-弧传递图的分类进行了刻划,确定了其自同构群的基柱．     

Valency seven symmetric graphs of order 2<Emphasis Type="Italic">pq</Emphasis>

A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, all connected valency seven symmetric graphs of order 2pq are classified, where p, q are distinct primes. It follows from the classification that there is a unique connected valency seven symmetric graph of order 4p, and that for odd primes p and q, there is an infinite family of connected valency seven one-regular graphs of order 2pq with solvable automorphism groups, and there are four sporadic ones with nonsolvable automorphism groups, which is 1, 2, 3-arc transitive, respectively. In particular, one of the four sporadic ones is primitive, and the other two of the four sporadic ones are bi-primitive.     

On regular graphs,V

Let Γ₃ be an infinite regular tree of valence 3. There exist subgroups B of Aut (Γ₃) which are 5-regular on Γ₃, i.e., sharply transitive on the set of 5-arcs of Γ₃. We prove that any two such subgroups are conjugate in Aut (Γ₃). The pair (Γ₃, B) is a universal 5-regular action in the sense that if (G, A) is a pair consisting of a cubical graph G and a 5-regular subgroup A of automorphisms of G then (G, A) can be “covered” by (Γ₃, B) in a certain natural way.