A Cayley graph Cay(G, S) on a group G is said to be normal if the right regular representation R(G) of G is normal in the full automorphism group of Cay(G, S). In this paper, two sufficient conditions for non-normal C...A Cayley graph Cay(G, S) on a group G is said to be normal if the right regular representation R(G) of G is normal in the full automorphism group of Cay(G, S). In this paper, two sufficient conditions for non-normal Cayley graphs are given and by using the conditions, five infinite families of connected non-normal Cayley graphs are constructed. As an application, all connected non-normal Cayley graphs of valency 5 on A 5 are determined, which generalizes a result about the normality of Cayley graphs of valency 3 or 4 on A 5 determined by Xu and Xu. Further, we classify all non-CI Cayley graphs of valency 5 on A 5, while Xu et al. have proved that A 5 is a 4-CI group.展开更多
Let p be an odd prime. In this paper we prove that all tetravalent connected Cayley graphs of order p^3 are normal. As an application, a classification of tetravalent symmetric graphs of odd prime-cube order is given.
Let G be a p-group (p odd prime) and let X = Cay(G, S) be a 4-valent connected Cayley graph. It is shown that if G has nilpotent class 2, then the automorphism group Ant(X) of X is isomorphic to the semidirect product...Let G be a p-group (p odd prime) and let X = Cay(G, S) be a 4-valent connected Cayley graph. It is shown that if G has nilpotent class 2, then the automorphism group Ant(X) of X is isomorphic to the semidirect product GR x Ant(G,S), where GR is the right regular representation of G and Aut(G,S) is the subgroup of the automorphism group Aut(G) of G which fixes S setwise. However the result is not true if G has nilpotent class 3 and this paper provides a counterexample.展开更多
LetG be a finite group, andS a subset ofG \ |1| withS =S ?1. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ A...LetG be a finite group, andS a subset ofG \ |1| withS =S ?1. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ?1 and | S | ≤m is Cl. In this paper we prove that the alternating groupA 5 is a 4-Cl-group, which was a conjecture posed by Li and Praeger.展开更多
A Cayley graph Г=Cay(G,S)is said to be normal if G is normal in Aut Г.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Г of finite nonabelian simple groups G,whe...A Cayley graph Г=Cay(G,S)is said to be normal if G is normal in Aut Г.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Г of finite nonabelian simple groups G,where the vertex stabilizer A_(u) is soluble for A=Aut Г and v∈∨Г.We prove that either Г is normal or G=A_(5),A_(10),A_(54),A_(274),A_(549) or A_(1099).Further,11-valent symmetric nonnormal Cayley graphs of As,A54 and A274 are constructed.This provides some more examples of nonnormal 11-valent symmetric Cayley graphs of finite nonabelian simple groups after the first graph of this kind(of valency 11)was constructed by Fang,Ma and Wang in 2011.展开更多
A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transit...A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.展开更多
A graph is called edge-transitive if its full automorphism group acts transitively on its edge set.In this paper,by using classification of finite simple groups,we classify tetravalent edge-transitive graphs of order ...A graph is called edge-transitive if its full automorphism group acts transitively on its edge set.In this paper,by using classification of finite simple groups,we classify tetravalent edge-transitive graphs of order p2q with p,q distinct odd primes.The result generalizes certain previous results.In particular,it shows that such graphs are normal Cayley graphs with only a few exceptions of small orders.展开更多
基金This work was supported by the NNSFC (Grant No. 10571013)KPCME (Grant No. 106029)SRFDP in China
文摘A Cayley graph Cay(G, S) on a group G is said to be normal if the right regular representation R(G) of G is normal in the full automorphism group of Cay(G, S). In this paper, two sufficient conditions for non-normal Cayley graphs are given and by using the conditions, five infinite families of connected non-normal Cayley graphs are constructed. As an application, all connected non-normal Cayley graphs of valency 5 on A 5 are determined, which generalizes a result about the normality of Cayley graphs of valency 3 or 4 on A 5 determined by Xu and Xu. Further, we classify all non-CI Cayley graphs of valency 5 on A 5, while Xu et al. have proved that A 5 is a 4-CI group.
文摘Let p be an odd prime. In this paper we prove that all tetravalent connected Cayley graphs of order p^3 are normal. As an application, a classification of tetravalent symmetric graphs of odd prime-cube order is given.
基金the National Natural Science Foundation of China (No.10071002) andCom2MaC-KOSEF.
文摘Let G be a p-group (p odd prime) and let X = Cay(G, S) be a 4-valent connected Cayley graph. It is shown that if G has nilpotent class 2, then the automorphism group Ant(X) of X is isomorphic to the semidirect product GR x Ant(G,S), where GR is the right regular representation of G and Aut(G,S) is the subgroup of the automorphism group Aut(G) of G which fixes S setwise. However the result is not true if G has nilpotent class 3 and this paper provides a counterexample.
基金the National Natural Science Foundation of China (Grant Nos. 19831050 and69873002) and the Doctoral Program Foundation of Institutions of Higher Education of China (Grant No. 97000141) , and also by Korea Science and Engineering Foundation (Grant No. K
文摘LetG be a finite group, andS a subset ofG \ |1| withS =S ?1. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ?1 and | S | ≤m is Cl. In this paper we prove that the alternating groupA 5 is a 4-Cl-group, which was a conjecture posed by Li and Praeger.
基金supported by the National Natural Science Foundation of China(11701503,11861076,12061089,11761079)Yunnan Applied Basic Research Projects(2018FB003,2019FB139)the third author was supported by the National Natural Science Foundation of China(11601263,11701321).
文摘A Cayley graph Г=Cay(G,S)is said to be normal if G is normal in Aut Г.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Г of finite nonabelian simple groups G,where the vertex stabilizer A_(u) is soluble for A=Aut Г and v∈∨Г.We prove that either Г is normal or G=A_(5),A_(10),A_(54),A_(274),A_(549) or A_(1099).Further,11-valent symmetric nonnormal Cayley graphs of As,A54 and A274 are constructed.This provides some more examples of nonnormal 11-valent symmetric Cayley graphs of finite nonabelian simple groups after the first graph of this kind(of valency 11)was constructed by Fang,Ma and Wang in 2011.
基金Research supported by the National Natural Science Foundation of China under Grant No.103710003
文摘A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.
基金supported by National Natural Science Foundation of China (Grant Nos.11071210 and 11171292)
文摘A graph is called edge-transitive if its full automorphism group acts transitively on its edge set.In this paper,by using classification of finite simple groups,we classify tetravalent edge-transitive graphs of order p2q with p,q distinct odd primes.The result generalizes certain previous results.In particular,it shows that such graphs are normal Cayley graphs with only a few exceptions of small orders.
