324 research outputs found
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
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
Vertex-transitive Haar graphs that are not Cayley graphs
In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a
question whether there exist vertex-transitive Haar graphs that are not Cayley
graphs. In this note we construct an infinite family of trivalent Haar graphs
that are vertex-transitive but non-Cayley. The smallest example has 40 vertices
and is the well-known Kronecker cover over the dodecahedron graph ,
occurring as the graph in the Foster census of connected symmetric
trivalent graphs.Comment: 9 pages, 2 figure
Edge-transitive bi-Cayley graphs
A graph \G admitting a group of automorphisms acting semi-regularly on
the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over
. Such a graph \G is called {\em normal\/} if is normal in the full
automorphism group of \G, and {\em normal edge-transitive\/} if the
normaliser of in the full automorphism group of \G is transitive on the
edges of \G. % In this paper, we give a characterisation of normal
edge-transitive bi-Cayley graphs, %which form an important subfamily of
bi-Cayley graphs, and in particular, we give a detailed description of
-arc-transitive normal bi-Cayley graphs. Using this, we investigate three
classes of bi-Cayley graphs, namely those over abelian groups, dihedral groups
and metacyclic -groups. We find that under certain conditions, `normal
edge-transitive' is the same as `normal' for graphs in these three classes. As
a by-product, we obtain a complete classification of all connected trivalent
edge-transitive graphs of girth at most , and answer some open questions
from the literature about -arc-transitive, half-arc-transitive and
semisymmetric graphs
Which Haar graphs are Cayley graphs?
For a finite group and subset of the Haar graph is a
bipartite regular graph, defined as a regular -cover of a dipole with
parallel arcs labelled by elements of . If is an abelian group, then
is well-known to be a Cayley graph; however, there are examples of
non-abelian groups and subsets when this is not the case. In this paper
we address the problem of classifying finite non-abelian groups with the
property that every Haar graph is a Cayley graph. An equivalent
condition for to be a Cayley graph of a group containing is
derived in terms of and . It is also shown that the
dihedral groups, which are solutions to the above problem, are
and .Comment: 13 pages, 2 figure
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
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 cyclic and dihedral covers of pentavalent symmetric graphs of order twice a prime
A regular cover of a connected graph is called {\em cyclic} or {\em dihedral}
if its transformation group is cyclic or dihedral respectively, and {\em
arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism
subgroup acts arc-transitively on the regular cover. In this paper, we give a
classification of arc-transitive cyclic and dihedral covers of a connected
pentavalent symmetric graph of order twice a prime. All those covers are
explicitly constructed as Cayley graphs on some groups, and their full
automorphism groups are determined
Eigenvalues of Cayley graphs
We survey some of the known results on eigenvalues of Cayley graphs and their
applications, together with related results on eigenvalues of Cayley digraphs
and generalizations of Cayley graphs
On groups all of whose Haar graphs are Cayley graphs
A Cayley graph of a group is a finite simple graph such that
contains a subgroup isomorphic to acting regularly on
, while a Haar graph of is a finite simple bipartite graph
such that contains a subgroup isomorphic to
acting semiregularly on and the -orbits are equal to the
bipartite sets of . A Cayley graph is a Haar graph exactly when it is
bipartite, but no simple condition is known for a Haar graph to be a Cayley
graph. In this paper, we show that the groups and
are the only finite inner abelian groups all of whose Haar graphs are
Cayley graphs (a group is called inner abelian if it is non-abelian, but all of
its proper subgroups are abelian). As an application, it is also shown that
every non-solvable group has a Haar graph which is not a Cayley graph.Comment: 17 page
- …