Arc-transitive cubic graphs of order four times an odd square-free integer

2017 ◽  
Vol 16 (11) ◽  
pp. 1750213 ◽  
Author(s):  
Bo Ling ◽  
Ben Gong Lou
Keyword(s):  
Automorphism Group ◽  
Cubic Graphs ◽  
Full Automorphism Group ◽  
Order Four

Xu, Zhang and Zhou [Chin. Ann. Math. 25B(4) (2004) 545–554] classified all arc-transitive cubic graphs of order [Formula: see text] with [Formula: see text] a prime. In this paper, we shall generalize this result by classifying all connected arc-transitive cubic graphs of order four times an odd square-free integer. It is shown that, for each of such graphs [Formula: see text], either the full automorphism group [Formula: see text] is isomorphic to [Formula: see text], [Formula: see text], [Formula: see text] or [Formula: see text], or [Formula: see text] is isomorphic to one of 5 graphs.

Automorphisms of a Family of Cubic Graphs

2013 ◽  
Vol 20 (03) ◽  
pp. 495-506 ◽  
Author(s):  
Jin-Xin Zhou ◽  
Mohsen Ghasemi
Keyword(s):  
Automorphism Group ◽  
Positive Integer ◽  
Cayley Graph ◽  
Regular Representation ◽  
Cayley Graphs ◽  
Cubic Graphs ◽  
Full Automorphism Group ◽  
Vertex Set ◽  
The Right ◽  
Normal Cayley Graphs

A Cayley graph Cay (G,S) on a group G with respect to a Cayley subset S 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). For a positive integer n, let Γn be a graph with vertex set {xi,yi|i ∈ ℤ2n} and edge set {{xi,xi+1}, {yi,yi+1}, {x2i,y2i+1}, {y2i,x2i+1}|i ∈ ℤ2n}. In this paper, it is shown that Γn is a Cayley graph and its full automorphism group is isomorphic to [Formula: see text] for n=2, and to [Formula: see text] for n > 2. Furthermore, we determine all pairs of G and S such that Γn= Cay (G,S) is non-normal for G. Using this, all connected cubic non-normal Cayley graphs of order 8p are constructed explicitly for each prime p.

scholarly journals Cubic symmetric graphs of order twice an odd prime-power

2006 ◽  
Vol 81 (2) ◽  
pp. 153-164 ◽  
Author(s):  
Yan-Quan Feng ◽  
Jin Ho Kwak
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Prime Power ◽  
Symmetric Graph ◽  
Cubic Graphs ◽  
Full Automorphism Group ◽  
Symmetric Graphs ◽  
Regular Subgroup

AbstractAn automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a connected cubic symmetric graph X of order 2pn for an odd prime p, we show that if p ≠ 5, 7 then every Sylow p-subgroup of the full automorphism group Aut(X) of X is normal, and if p ≠3 then every s-regular subgroup of Aut(X) having a normal Sylow p-subgroup contains an (s − 1)-regular subgroup for each 1 ≦ s ≦ 5. As an application, we show that every connected cubic symmetric graph of order 2pn is a Cayley graph if p > 5 and we classify the s-regular cubic graphs of order 2p2 for each 1≦ s≦ 5 and each prime p. as a continuation of the authors' classification of 1-regular cubic graphs of order 2p2. The same classification of those of order 2p is also done.

scholarly journals Cohomological finiteness conditions and centralisers in generalisations of Thompson’s group V

2016 ◽  
Vol 28 (5) ◽  
pp. 909-921 ◽  
Author(s):  
Conchita Martínez-Pérez ◽  
Francesco Matucci ◽  
Brita E. A. Nucinkis
Keyword(s):  
Automorphism Group ◽  
Finiteness Conditions ◽  
Group V ◽  
Full Automorphism Group ◽  
Finite Subgroups ◽  
Thompson’S Group

AbstractWe consider generalisations of Thompson’s group V, denoted by ${V_{r}(\Sigma)}$, which also include the groups of Higman, Stein and Brin. We show that, under some mild hypotheses, ${V_{r}(\Sigma)}$ is the full automorphism group of a Cantor algebra. Under some further minor restrictions, we prove that these groups are of type ${\operatorname{F}_{\infty}}$ and that this implies that also centralisers of finite subgroups are of type ${\operatorname{F}_{\infty}}$.

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.

scholarly journals Rooted trees, strong cofinality and ample generics

2012 ◽  
Vol 154 (2) ◽  
pp. 213-223
Author(s):  
MACIEJ MALICKI
Keyword(s):  
Automorphism Group ◽  
Open Subgroup ◽  
Rooted Trees ◽  
Full Automorphism Group

AbstractWe characterize those countable rooted trees with non-trivial components whose full automorphism group has uncountable strong cofinality, and those whose full automorphism group contains an open subgroup with ample generics.

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 identity graphs and planar graphs derived from trees

1970 ◽  
Vol 11 (2) ◽  
pp. 207-215 ◽  
Author(s):  
A. T. Balaban ◽  
Roy O. Davies ◽  
Frank Harary ◽  
Anthony Hill ◽  
Roy Westwick
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Planar Graphs ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
Plane Trees ◽  
Nontrivial Identity

AbstractThe smallest (nontrivial) identity graph is known to have six points and the smallest identity tree seven. It is now shown that the smallest cubic identity graphs have 12 points and that exactly two of them are planar, namely those constructed by Frucht in his proof that every finite group is isomorphic to the automorphism group of some cubic graph. Both of these graphs can be obtained from plane trees by joining consecutive endpoints; it is shown that when applied to identity trees this construction leads to identity graphs except in certain specified cases. In appendices all connected cubic graphs with 10 points or fewer, and all cubic nonseparable planar graphs with 12 points, are displayed.

Full automorphism group of the generalized symplectic graph

2013 ◽  
Vol 56 (7) ◽  
pp. 1509-1520 ◽  
Author(s):  
LiWei Zeng ◽  
Zhao Chai ◽  
RongQuan Feng ◽  
ChangLi Ma
Keyword(s):  
Automorphism Group ◽  
Full Automorphism Group

scholarly journals The automorphism group of the -orbifold of the Barnes–Wall lattice vertex operator algebra of central charge 32

2014 ◽  
Vol 156 (2) ◽  
pp. 343-361 ◽  
Author(s):  
HIROKI SHIMAKURA
Keyword(s):  
Automorphism Group ◽  
Vertex Operator ◽  
Operator Algebra ◽  
Vertex Operator Algebra ◽  
Central Charge ◽  
Group Structure ◽  
Graph Structure ◽  
Full Automorphism Group ◽  
Lattice Vertex Operator Algebra

AbstractIn this paper, we prove that the full automorphism group of the ${\mathbb Z}_2$-orbifold of the Barnes–Wall lattice vertex operator algebra of central charge 32 has the shape 227.E6(2). In order to identify the group structure, we introduce a graph structure on the Griess algebra and show that it is a rank 3 graph associated to E6(2).

Sign in / Sign up

Export Citation Format

Share Document