Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices

The theory of voltage graphs has become a standard tool in the study of graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting a cyclic group of automorphisms that may not be semiregular. We use this new tool to classify all cubic graphs admitting a cyclic group of automorphisms with at most three vertex-orbits and we characterise vertex-transitivity for each of these classes. In particular, we show that a cubic vertex-transitive graph admitting a cyclic group of automorphisms with at most three orbits on vertices either belongs to one of 5 infinite families or is isomorphic to the well-known Tutte–Coxeter graph.     

Semiregular automorphisms of edge-transitive graphs

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial automorphism whose cycles all have the same length. In this paper, we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.     

Isomorphisms of finite semi-Cayley graphs

Let G be a finite group. A Cayley graph over G is a simple graph whose automorphism group has a regular subgroup isomorphic to G. A Cayley graph is called a CI-graph(Cayley isomorphism) if its isomorphic images are induced by automorphisms of G. A well-known result of Babai states that a Cayley graph Γ of G is a CI-graph if and only if all regular subgroups of Aut(Γ) isomorphic to G are conjugate in Aut(Γ). A semi-Cayley graph(also called bi-Cayley graph by some authors) over G is a simple graph whose automorphism group has a semiregular subgroup isomorphic to G with two orbits(of equal size). In this paper, we introduce the concept of SCI-graph(semi-Cayley isomorphism)and prove a Babai type theorem for semi-Cayley graphs. We prove that every semi-Cayley graph of a finite group G is an SCI-graph if and only if G is cyclic of order 3. Also, we study the isomorphism problem of a special class of semi-Cayley graphs.     

Elusive groups of automorphisms of digraphs of small valency

A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.     

Algebraic structures on graphs

In this paper we consider directed graphs with algebraic structures: group-graphs, ringgraphs, involutorial graphs, affine graphs, graphs of morphisms between graphs, graphs of reduced paths of an involutorial graph, etc. We show also how several well-known algebraic constructions can be carried over to graphs. As a typical example we generalize the construction of the group of automorphisms of a set, by constructing a group-graph associated with any given graphΓ. It is the group-graph of reduced paths of the involutorial graph associated to the graph of automorphisms ofΓ.     

On the classification of quartic half-arc-transitive metacirculants

A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ, where ρ is (m,n)-semiregular for some integers m≥1 and n≥2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ^m has at least one fixed vertex. In a recent paper Maruši? and the author showed that each connected quartic half-arc-transitive metacirculant belongs to one (or possibly more) of four classes of such graphs, reflecting the structure of the quotient graph relative to the semiregular automorphism ρ. One of these classes coincides with the class of the so-called tightly-attached graphs, which have already been completely classified. In this paper a complete classification of the second of these classes, that is the class of quartic half-arc-transitive metacirculants for which the quotient graph relative to the semiregular automorphism ρ is a cycle with a loop at each vertex, is given.     

Automorphisms of Cayley graphs

The aim of this paper is to characterize subgroups of non-regular automorphism groups of Cayley graphs. Relations between group automorphisms, graph automorphisms and permutations of the edge set of Cayley graphs are investigated.     

The Ihara zeta function of the complement of a semiregular bipartite graph

We study the Ihara zeta function of the complement of a semiregular bipartite graph. A factorization formula for the Ihara zeta function is derived via which the number of spanning trees is computed. For a class of complements of semiregular bipartite graphs, it is shown that they have the same Ihara zeta function if and only if they are cospectral.     

Zeta functions and complexities of a semiregular bipartite graph and its line graph

We treat zeta functions and complexities of semiregular bipartite graphs. Furthermore, we give formulas for zeta function and the complexity of a line graph of a semiregular bipartite graph. As a corollary, we present the complexity of a line graph of a complete bipartite graph.     

Coverings of Graphs and Maps, Orthogonality, and Eigenvectors

Lifts of graph and map automorphisms can be described in terms of voltage assignments that are, in a sense, compatible with the automorphisms. We show that compatibility of ordinary voltage assignments in Abelian groups is related to orthogonality in certain -modules. For cyclic groups, compatibility turns out to be equivalent with the existence of eigenvectors of certain matrices that are naturally associated with graph automorphisms. This allows for a great simplification in characterizing compatible voltage assignments and has applications in constructions of highly symmetric graphs and maps.     

Petersen图的点传递正则覆盖图

运用基图自同构能被提升的线性准则 ,对满足 :1覆叠变换群 K =Znp,2覆盖图的保簇变换群是点传递的 Petersen图的连通正则覆盖图进行了完全分类 .这种图共有 1 2种类型 .     

Representing Groups by Colourings of Graphs

The topic of this paper is representing groups by edge-coloured graphs. Every edge-coloured graph determines a group of graph automorphisms which preserve the colours of the edges. An edge colouring of a graph G is called a perfect one iff every colour class is a perfect matching in G. We prove that every group H and all of its subgroups can be represented (up to isomorphism) by a group of colour preserving automorphisms related to some perfect colouring of the same graph.     

Mobility of vertex-transitive graphs

We define the mobility of a graph automorphism as the minimum distance between a vertex of the graph and its image under the automorphism, and the absolute mobility of a graph as the maximum of the mobilities of its automorphisms. In this paper, we investigate the mobility of certain classes of graphs, in particular, Cartesian and lexicographic products, vertex-transitive graphs, and Cayley graphs.     

Unitary graphs and classification of a family of symmetric graphs with complete quotients

A finite graph Γ is called G-symmetric if G is a group of automorphisms of Γ which is transitive on the set of ordered pairs of adjacent vertices of Γ. We study a family of symmetric graphs, called the unitary graphs, whose vertices are flags of the Hermitian unital and whose adjacency relations are determined by certain elements of the underlying finite fields. Such graphs admit the unitary groups as groups of automorphisms, and play a significant role in the classification of a family of symmetric graphs with complete quotients such that an associated incidence structure is a doubly point-transitive linear space. We give this classification in the paper and also investigate combinatorial properties of the unitary graphs.     

Primitive decompositions of Johnson graphs

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.     

Rank 3 Transitive Decompositions of Complete Multipartite Graphs

A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. This paper deals with transitive decompositions of complete multipartite graphs preserved by an imprimitive rank 3 permutation group. We obtain a near-complete classification of these when the group in question has an almost simple component.     

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs

Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we employ two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight line drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.     

Complete regular dessins of odd prime power order

A dessin is a 2-cell embedding of a connected 2-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper we employ group-theoretic method to determine and enumerate the isomorphism classes of regular dessins with complete bipartite underlying graphs of odd prime power order.     

Retarded regular graphs are regular or semiregular

A graph G is said to be retarded regular if there is a positive integral number s such that the number of walks of length s starting at vertices of G is a constant function. Regular and semiregular graphs are retarded regular with s?=?1 and s\!≤ \!2, respectively. We prove that any retarded regular connected graph is either regular or semiregular.     

Kantenprimitive Graphen vom Grad drei

A graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitive permutation group on the set of edges (vertices). It is shown that there are only four edge-primitive trivalent graphs. Three are bipartite cages; the fourth, with 102 vertices, is also vertex-primitive.