For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms.
In this paper we consider undirected graphs without loops or multiple edges. For a graph 1 we denote by V(1), E(1), and Aut(1) the vertex set,.
In this paper we consider undirected graphs without loops or multiple edges. For a graph 1 we denote by V(1), E(1), and Aut(1) the vertex set,.
Dec 7, 2013 · Moreover, the automorphism group is generated by a and b, where I now think of the paths as giving me a covering transformation: I can go from ...
In this note we extend the exploration of automorphism groups of distance preserving graph covers. We apply the technique of graph covers to determine the ...
Our first result is the following theorem for groups acting on a graph without edge reversing. Theorem 1 (M., 2013). Let X be a graph of genus g and G is a ...
We begin with the classes of graphs first presented in Section 2. Theorem 4.1. The automorphism group of the complete graph on n vertices Aut(Kn) is isomorphic.
For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms.
Let G be a group and H a subgroup of G. It is shown that there exists a partially ordered set (X, ⩽) such that G is isomorphic to the group of all a.
In this note we extend the exploration of automorphism groups of distance preserving graph covers. We apply the technique of graph covers to determine the ...