320 research outputs found
Arc-transitive cubic abelian bi-Cayley graphs and BCI-graphs
A finite simple graph is called a bi-Cayley graph over a group if it has
a semiregular automorphism group, isomorphic to which has two orbits on
the vertex set. Cubic vertex-transitive bi-Cayley graphs over abelian groups
have been classified recently by Feng and Zhou (Europ. J. Combin. 36 (2014),
679--693). In this paper we consider the latter class of graphs and select
those in the class which are also arc-transitive. Furthermore, such a graph is
called -type when it is bipartite, and the bipartition classes are equal to
the two orbits of the respective semiregular automorphism group. A -type
graph can be represented as the graph where is a
subset of the vertex set of which consists of two copies of say
and and the edge set is . A
bi-Cayley graph is called a BCI-graph if for any bi-Cayley
graph
implies that for some and . It is also shown that every cubic connected arc-transitive
-type bi-Cayley graph over an abelian group is a BCI-graph
Cubic vertex-transitive graphs on up to 1280 vertices
A graph is called cubic and tetravalent if all of its vertices have valency 3
and 4, respectively. It is called vertex-transitive and arc-transitive if its
automorphism group acts transitively on its vertex-set and on its arc- set,
respectively. In this paper, we combine some new theoretical results with
computer calculations to construct all cubic vertex-transitive graphs of order
at most 1280. In the process, we also construct all tetravalent arc-transitive
graphs of order at most 640
Heptavalent symmetric graphs with solvable stabilizers admitting vertex-transitive non-abelian simple groups
A graph is said to be symmetric if its automorphism group acts transitively on the arc set of . In this paper, we
show that if is a finite connected heptavalent symmetric graph with
solvable stabilizer admitting a vertex-transitive non-abelian simple group
of automorphisms, then either is normal in , or contains a non-abelian simple normal subgroup such that and is explicitly given as one of possible exception pairs of
non-abelian simple groups. Furthermore, if is regular on the vertex set of
then the exception pair is one of possible pairs, and if
is arc-transitive then the exception pair or
.Comment: 9. arXiv admin note: substantial text overlap with arXiv:1701.0118
A classification of nilpotent 3-BCI groups
Given a finite group and a subset the bi-Cayley graph
\bcay(G,S) is the graph whose vertex set is and edge set
is . A bi-Cayley graph \bcay(G,S)
is called a BCI-graph if for any bi-Cayley graph \bcay(G,T), \bcay(G,S)
\cong \bcay(G,T) implies that for some and \alpha
\in \aut(G). A group is called an -BCI-group if all bi-Cayley graphs of
of valency at most are BCI-graphs.In this paper we prove that, a finite
nilpotent group is a 3-BCI-group if and only if it is in the form
where is a homocyclic group of odd order, and is trivial or one of the
groups and \Q_8
Arc-transitive Cayley graphs on non-ableian simple groups with soluble vertex stabilizers and valency seven
In this paper, we study arc-transitive Cayley graphs on non-abelian simple
groups with soluble stabilizers and valency seven. Let \Ga be such a Cayley
graph on a non-abelian simple group . It is proved that either \Ga is a
normal Cayley graph or \Ga is -arc-transitive, with
(S,T)=(\A_n,\A_{n-1}) and or ; and, for each of these four
values of , there really exists arc-transitive -valent non-normal Cayley
graphs on \A_{n-1} and specific examples are constructed
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms
Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a
nowhere-zero 3-flow. In this note we prove that every regular graph of valency
at least four admitting a solvable arc-transitive group of automorphisms admits
a nowhere-zero 3-flow.Comment: This is the final version to be published in: Ars Mathematica
Contemporanea (http://amc-journal.eu/index.php/amc
Cubic vertex-transitive non-Cayley graphs of order 12p
A graph is said to be {\em vertex-transitive non-Cayley} if its full
automorphism group acts transitively on its vertices and contains no subgroups
acting regularly on its vertices. In this paper, a complete classification of
cubic vertex-transitive non-Cayley graphs of order , where is a prime,
is given. As a result, there are sporadic and one infinite family of such
graphs, of which the sporadic ones occur when , or , and the
infinite family exists if and only if , and in this family
there is a unique graph for a given order.Comment: This paper has been accepted for publication in SCIENCE CHINA
Mathematic
Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
In this paper, we prove that the maximal order of a semiregular element in
the automorphism group of a cubic vertex-transitive graph X does not tend to
infinity as the number of vertices of X tends to infinity. This gives a
solution (in the negative) to a conjecture of Peter Cameron, John Sheehan and
the author.
However, with an application of the positive solution of the restricted
Burnside problem, we show that this conjecture holds true when X is either a
Cayley graph or an arc-transitive graph.Comment: 18 pages, 1 figur
On cubic symmetric non-Cayley graphs with solvable automorphism groups
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs
with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015),
1-11] that a cubic symmetric graph with a solvable automorphism group is either
a Cayley graph or a -regular graph of type , that is, a graph with no
automorphism of order interchanging two adjacent vertices. In this paper an
infinite family of non-Cayley cubic -regular graphs of type with a
solvable automorphism group is constructed. The smallest graph in this family
has order 6174.Comment: 8 page
Arc-transitive bicirculants
In this paper, we characterise the family of finite arc-transitive
bicirculants. We show that every finite arc-transitive bicirculant is a normal
-cover of an arc-transitive graph that lies in one of eight infinite
families or is one of seven sporadic arc-transitive graphs. Moreover, each of
these ``basic'' graphs is either an arc-transitive bicirculant or an
arc-transitive circulant, and each graph in the latter case has an
arc-transitive bicirculant normal -cover for some integer
- …