scholarly journals Cubic Edge-Transitive Bi-$p$-Metacirculants

10.37236/6417 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Yan-Li Qin ◽  
Jin-Xin Zhou
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Infinite Family ◽  
Group Of Automorphisms ◽  
Group A ◽  
Semisymmetric Graphs ◽  
Edge Transitive

A graph is said to be a bi-Cayley graph over a group $H$ if it admits $H$ as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime $p$, we call a bi-Cayley graph over a metacyclic $p$-group a bi-$p$-metacirculant. In this paper, the automorphism group of a connected cubic edge-transitive bi-$p$-metacirculant is characterized for an odd prime $p$, and the result reveals that a connected cubic edge-transitive bi-$p$-metacirculant exists only when $p=3$. Using this, a classification is given of connected cubic edge-transitive bi-Cayley graphs over an inner-abelian metacyclic $3$-group. As a result, we construct the first known infinite family of cubic semisymmetric graphs of order twice a $3$-power.

scholarly journals CLASSIFICATION OF TETRAVALENT -TRANSITIVE NONNORMAL CAYLEY GRAPHS OF FINITE SIMPLE GROUPS

2021 ◽  
pp. 1-9
Author(s):  
XIN GUI FANG ◽  
JIE WANG ◽  
SANMING ZHOU
Keyword(s):  
Automorphism Group ◽  
Simple Group ◽  
Cayley Graph ◽  
Finite Simple Group ◽  
Cayley Graphs ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
Edge Transitive

Abstract A graph $\Gamma $ is called $(G, s)$ -arc-transitive if $G \le \text{Aut} (\Gamma )$ is transitive on the set of vertices of $\Gamma $ and the set of s-arcs of $\Gamma $ , where for an integer $s \ge 1$ an s-arc of $\Gamma $ is a sequence of $s+1$ vertices $(v_0,v_1,\ldots ,v_s)$ of $\Gamma $ such that $v_{i-1}$ and $v_i$ are adjacent for $1 \le i \le s$ and $v_{i-1}\ne v_{i+1}$ for $1 \le i \le s-1$ . A graph $\Gamma $ is called 2-transitive if it is $(\text{Aut} (\Gamma ), 2)$ -arc-transitive but not $(\text{Aut} (\Gamma ), 3)$ -arc-transitive. A Cayley graph $\Gamma $ of a group G is called normal if G is normal in $\text{Aut} (\Gamma )$ and nonnormal otherwise. Fang et al. [‘On edge transitive Cayley graphs of valency four’, European J. Combin.25 (2004), 1103–1116] proved that if $\Gamma $ is a tetravalent 2-transitive Cayley graph of a finite simple group G, then either $\Gamma $ is normal or G is one of the groups $\text{PSL}_2(11)$ , $\text{M} _{11}$ , $\text{M} _{23}$ and $A_{11}$ . However, it was unknown whether $\Gamma $ is normal when G is one of these four groups. We answer this question by proving that among these four groups only $\text{M} _{11}$ produces connected tetravalent 2-transitive nonnormal Cayley graphs. We prove further that there are exactly two such graphs which are nonisomorphic and both are determined in the paper. As a consequence, the automorphism group of any connected tetravalent 2-transitive Cayley graph of any finite simple group is determined.

scholarly journals Cubic Vertex-Transitive Non-Cayley Graphs of Order $8p$

10.37236/2087 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Jin-Xin Zhou ◽  
Yan-Quan Feng
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Infinite Family ◽  
The Other ◽  
Transitive Graph ◽  
Vertex Transitive ◽  
Unique Graph ◽  
Vertex Transitive Graph

A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertex-transitive non-Cayley graphs of order $8p$ are classified for each prime $p$. It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order $56$,  one infinite family exists for every prime $p>3$ and the other family exists if and only if $p\equiv 1\mod 4$. For each family there is a unique graph for a given order.

scholarly journals Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups

ISRN Algebra ◽  
2011 ◽  
Vol 2011 ◽  
pp. 1-6
Author(s):  
Mehdi Alaeiyan ◽  
Siamak Firouzian ◽  
Mohsen Ghasemi
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Partial Answer ◽  
Dihedral Groups ◽  
Undirected Edge ◽  
A Finite Group ◽  
Edge Transitive

A Cayley graph of a finite group is called normal edge transitive if its automorphism group has a subgroup which both normalizes and acts transitively on edges. In this paper we determine all cubic, connected, and undirected edge-transitive Cayley graphs of dihedral groups, which are not normal edge transitive. This is a partial answer to the question of Praeger (1999).

Automorphism Groups of Connected Cubic Cayley Graphs of Order 4p

2007 ◽  
Vol 14 (02) ◽  
pp. 351-359 ◽  
Author(s):  
Chuixiang Zhou ◽  
Yan-Quan Feng
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Dihedral Group ◽  
Automorphism Groups ◽  
Regular Representation ◽  
Cayley Graphs ◽  
Three Dimensional ◽  
Group A ◽  
The Right

For a prime p, let D4p be the dihedral group 〈a,b | a2p = b2 = 1, b-1ab = a-1〉 of order 4p, and Cay (G,S) a connected cubic Cayley graph of order 4p. In this paper, it is shown that the automorphism group Aut ( Cay (G,S)) of Cay (G,S) is the semiproduct R(G) ⋊ Aut (G,S), where R(G) is the right regular representation of G and Aut (G,S) = {α ∈ Aut (G) | Sα = S}, except either G = D4p (p ≥ 3), Sβ = {b,ab,apb} for some β ∈ Aut (D4p) and [Formula: see text], or Cay (G,S) is isomorphic to the three-dimensional hypercube Q3[Formula: see text] and G = ℤ4 × ℤ2 or D8.

scholarly journals Normal Edge-Transitive Cayley Graphs of the Group U6n

2014 ◽  
Vol 2014 ◽  
pp. 1-4
Author(s):  
A. Assari ◽  
F. Sheikhmiri
Keyword(s):  
Cayley Graph ◽  
Cayley Graphs ◽  
The Right ◽  
Edge Transitive

A Cayley graph of a group G is called normal edge-transitive if the normalizer of the right representation of the group in the automorphism of the Cayley graph acts transitively on the set of edges of the graph. In this paper, we determine all connected normal edge-transitive Cayley graphs of the group U6n.

scholarly journals Cubic arc-transitive Cayley graphs on Frobenius groups

2018 ◽  
Vol 17 (07) ◽  
pp. 1850126 ◽  
Author(s):  
Hailin Liu ◽  
Lei Wang
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Frobenius Groups

A Cayley graph [Formula: see text] is called arc-transitive if its automorphism group [Formula: see text] is transitive on the set of arcs in [Formula: see text]. In this paper, we give a characterization of cubic arc-transitive Cayley graphs on a class of Frobenius groups.

scholarly journals Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer

2019 ◽  
Vol 17 (1) ◽  
pp. 513-518
Author(s):  
Hailin Liu
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Frobenius Groups ◽  
Full Automorphism Group

Abstract A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex stabilizer.

A 2-ARC TRANSITIVE PENTAVALENT CAYLEY GRAPH OF 

2016 ◽  
Vol 93 (3) ◽  
pp. 441-446 ◽  
Author(s):  
BO LING ◽  
BEN GONG LOU
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Discrete Math ◽  
Simple Groups ◽  
Alternating Group ◽  
Full Automorphism Group ◽  
Symmetric Graphs

Zhou and Feng [‘On symmetric graphs of valency five’, Discrete Math. 310 (2010), 1725–1732] proved that all connected pentavalent 1-transitive Cayley graphs of finite nonabelian simple groups are normal. We construct an example of a nonnormal 2-arc transitive pentavalent symmetric Cayley graph on the alternating group $\text{A}_{39}$. Furthermore, we show that the full automorphism group of this graph is isomorphic to the alternating group $\text{A}_{40}$.

scholarly journals Cubic Non-Cayley Vertex-Transitive Bi-Cayley Graphs over a Regular $p$-Group

10.37236/3915 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Jin-Xin Zhou ◽  
Yan-Quan Feng
Keyword(s):  
Cayley Graph ◽  
Cayley Graphs ◽  
Equal Size ◽  
Group Of Automorphisms ◽  
Vertex Transitive ◽  
Vertex Transitive Graphs ◽  
Transitive Graphs

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular $p$-group, where $p>5$ is an odd prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order $2p^3$ is given for each prime $p$.

scholarly journals A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2935
Author(s):  
Bo Ling ◽  
Wanting Li ◽  
Bengong Lou
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Automorphism Groups ◽  
Cayley Graphs ◽  
Vital Role ◽  
Alternating Group ◽  
Full Automorphism Group ◽  
Base Group

A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y. Xu in 1998 and it plays a vital role in determining the full automorphism groups of Cayley graphs. In this paper, we construct an example of a 2-arc transitive hexavalent nonnormal Cayley graph on the alternating group A119. Furthermore, we determine the full automorphism group of this graph and show that it is isomorphic to A120.

Sign in / Sign up

Export Citation Format

Share Document