𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automorphism groups of graphs with 1-factorizations

✍ Scribed by Ulrike Baumann


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
523 KB
Volume
158
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


A l-factorization cp of a simple undirected connected graph G is an edge colouring such that each vertex is incident with exactly one edge of each colour. The automorphisms which preserve the colours of all edges constitute a group A,(G, q). We prove every finitely generated group H to be isomorphic to the full group A,(G,cp) for a regular graph G of degree 3 with a l-factorization cp. Moreover we show that for every finitely generated group H there is a regular graph G of degree 5 such that the group H and all of its subgroups can be represented (up to isomorphism) by a group of colour preserving automorphisms related to some l-factorization cp of G.


πŸ“œ SIMILAR VOLUMES


One-factorizations of complete graphs wi
✍ Arrigo Bonisoli; Domenico Labbate πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

Automorphism Groups of Graphs with Quadr
✍ Norbert Seifter; Vladimir I. Trofimov πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 275 KB

Let 1 be a graph with almost transitive group Aut(1) and quadratic growth. We show that Aut(1) contains an almost transitive subgroup isomorphic to the free abelian group Z 2 .

Automorphism Groups of Covering Graphs
✍ Norbert Seifter; Vladimir I. Trofimov πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 226 KB

For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Γ‚2-transitive and 1-regular graphs.

Graphs with symmetric automorphism group
✍ W. D. Wallis; Katherine Heinrich πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract We investigate the properties of graphs whose automorphism group is the symmetric group. In particular, we characterize graphs on less than 2__n__ points with group __S~n~__, and construct all graphs on __n__ + 3 points with group __S~n~__. Graphs with 2__n__ or more points and group __