2^n和2p^2阶群上Cayley图的Hamilton图的分解

主要给出几类非交换群对Alspach猜想（当Cay（G,S）的度小于等于4时）成立,进一步对2n和2p2阶群Cayley图的Hamilton圈的分解进行了讨论.     

2n和2p2阶群上Cayley图的Hamilton图的分解

主要给出几类非交换群对Alspach猜想(当Cay(G,S)的度小于等于4时)成立,进一步对2n和2p2阶群Cayley图的Hamilton圈的分解进行了讨论.     

On the Normality of Cayley Digraphs of Valency 2 on Non-Abelian Group of Odd Order

In this paper, we prove that the Cayley digraph = Cay(G, S) of valency 2 on non-abelian group G of odd order is normal if the automorphism group of A(), a graph constructed from by using the method presented in the paper, is primitive on the vertices set V(A(). We also prove that the Cayley digraphs of valency 2 on non-abelian group of order pq² are normal, where p and q are distinct odd primes.AMS Subject Classification (2000) 05C25 20B25Supported by the National Natural Science Foundation of China (Grant no. 19971086) and the Doctoral Program Foundation of the National Education Department of China.     

正圆有向图中的弧不相交的Hamilton路和圈

2012年,Bang-Jensen和Huang(J.Combin.Theory Ser.B.2012,102:701-714)证明了2-弧强的局部半完全有向图可以分解为两个弧不相交的强连通生成子图当且仅当D不是偶圈的二次幂,并提出了任意3-强的局部竞赛图中包含两个弧不相交的Hamilton圈的猜想.主要研究正圆有向图中的弧不相交的Hamilton路和Hamilton圈,并证明了任意3-弧强的正圆有向图中包含两个弧不相交的Hamilton圈和任意4-弧强的正圆有向图中包含一个Hamilton圈和两个Hamilton路,使得它们两两弧不相交.由于任意圆有向图一定是正圆有向图,所得结论可以推广到圆有向图中.又由于圆有向图是局部竞赛图的子图类,因此所得结论说明对局部竞赛图的子图类――圆有向图,Bang-Jensen和Huang的猜想成立.     

Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity

Let Γ be a connected simple graph, let V(Γ) and E(Γ) denote the vertex-set and the edge-set of Γ, respectively, and let n=|V(Γ)|. For 1≤i≤n, let e_i be the element of elementary abelian group which has 1 in the ith coordinate, and 0 in all other coordinates. Assume that V(Γ)={e_i∣1≤i≤n}. We define a set Ω by Ω={e_i+e_j∣{e_i,e_j}∈E(Γ)}, and let Cay_Γ denote the Cayley graph over with respect to Ω. It turns out that Cay_Γ contains Γ as an isometric subgraph. In this paper, the relations between the spectra of Γ and Cay_Γ are discussed. Some conditions on the existence of Hamilton paths and cycles in Γ are obtained.     

Planarity of Cayley graphs of graph products of groups

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.     

Hamilton cycles and paths in vertex-transitive graphs—Current directions

In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given.     

4p阶二面体群连通3度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)称为正规的,如果G的右正则表示R(G)在X的自同构群Aut(X)中是正规的.设G是4p阶二面体群(p为素数).考察了Cay(G,S)连通3度的正规性,并给出了这些图的全自同构群.     

Some results on diameters of Cayley graphs

In this note we obtain a simple expression of any finite group by means of its generating set. Applying this result we partly solve a conjecture on diameters of Cayley graphs proposed by Babai and Seress. We also obtain some other conclusions on diameters on Cayley graphs.     

Automorphism Groups of 2-Valent Connected Cayley Digraphs on Regular <Emphasis Type="Italic">p</Emphasis>-Groups

 Let X=Cay(G,S) be a 2-valent connected Cayley digraph of a regular p-group G and let G _R be the right regular representation of G. It is proved that if G _R is not normal in Aut(X) then X≅[2K ₁ ] with n>1, Aut(X) ≅Z ₂ wrZ _2n , and either G=Z _2n+1 =<a> and S={a,a ²ⁿ⁺¹ }, or G=Z _2n ×Z ₂ =<a>×<b> and S={a,ab}. Received: May 26, 1999 Final version received: June 19, 2000     

The exponent of the primitive Cayley digraphs on finite Abelian groups

Let G be finite group and let S be a subset of G. We prove a necessary and sufficient condition for the Cayley digraph X_{(G, S)} to be primitive when S contains the central elements of G. As an immediate consequence we obtain that a Cayley digraph X_{(G, S)} on an Abelian group is primitive if and only if S^−1S is a generating set for G. Moreover, it is shown that if a Cayley digraph X_{(G, S)} on an Abelian group is primitive, then its exponent either is or is not exceeding . Finally, we also characterize those Cayley digraphs on Abelian groups with exponent . In particular, we generalize a number of well-known results for the primitive circulant matrices.     

Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph

In 1996, J.C. Bermond, T. Kodate, S. Perennes and N. Marlin conjectured that the set F_σ of fixed points of some complete rotation σ of the toroidal mesh TM(p)^k is not separating (that is F_σ does not disconnect TM(p)^k). They also conjectured that the set F_ω of fixed points of any complete rotation ω of any Cayley digraph is not separating. In this paper, we prove the first conjecture and disprove the second one.     

Hamilton paths and cycles in vertex-transitive graphs of order

It is shown that every connected vertex-transitive graph of order 6p, where p is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order 6p which is not genuinely imprimitive contains a Hamilton cycle.     

An infinite family of cubic nonnormal Cayley graphs on nonabelian simple groups

We construct a connected cubic nonnormal Cayley graph on ${\mathrm{A}}_{2^m?1}$ for each integer $m?4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on nonabelian simple groups.     

A class of Hamiltonian and edge symmetric Cayley graphs on symmetric groups

Abstract. Let Sn be the symmetric group     

On the number of transversals in Cayley tables of cyclic groups

It is well known that if n is even, the addition table for the integers modulo n (which we denote by B_n) possesses no transversals. We show that if n is odd, then the number of transversals in B_n is at least exponential in n. Equivalently, for odd n, the number of diagonally cyclic latin squares of order n, the number of complete mappings or orthomorphisms of the cyclic group of order n, the number of magic juggling sequences of period n and the number of placements of n non-attacking semi-queens on an n×n toroidal chessboard are at least exponential in n. For all large n we show that there is a latin square of order n with at least (3.246)ⁿ transversals.We diagnose all possible sizes for the intersection of two transversals in B_n and use this result to complete the spectrum of possible sizes of homogeneous latin bitrades.We also briefly explore potential applications of our results in constructing random mutually orthogonal latin squares.     

On the number of noncritical vertices in strongly connected digraphs

By definition, a vertex w of a strongly connected (or, simply, strong) digraph D is noncritical if the subgraph D — w is also strongly connected. We prove that if the minimal out (or in) degree k of D is at least 2, then there are at least k noncritical vertices in D. In contrast to the case of undirected graphs, this bound cannot be sharpened, for a given k, even for digraphs of large order. Moreover, we show that if the valency of any vertex of a strong digraph of order n is at least 3/4n, then it contains at least two noncritical vertices. The proof makes use of the results of the theory of maximal proper strong subgraphs established by Mader and developed by the present author. We also construct a counterpart of this theory for biconnected (undirected) graphs.