𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automorphism Groups of Graphs with Quadratic Growth

✍ Scribed by Norbert Seifter; Vladimir I. Trofimov


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
275 KB
Volume
71
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis


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 .


πŸ“œ SIMILAR VOLUMES


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 __

Direct products of automorphism groups o
✍ Mariusz Grech πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and w

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 group and diameter of a gra
✍ P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 178 KB πŸ‘ 1 views

## Abstract Given a connected graph Ξ“ of order __n__ and diameter __d__, we establish a tight upper bound for the order of the automorphism group of Ξ“ as a function of __n__ and __d__, and determine the graphs for which the bound is attained. Β© 2011 Wiley Periodicals, Inc. J Graph Theory.