## Abstract A perfect edge colouring of a graph is defined by the property that all colour matchings are perfect matchings. Every edgeβcoloured graph determines a group of graph automorphisms which preserve the colours of the edges. If the graph is connected, then this group of colour preserving au
A Note on I-Automorphisms
β Scribed by J.C. Beidleman; H. Heineken
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 113 KB
- Volume
- 234
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
dedicated to professor helmut wielandt on the occasion of his 90th birthday
1. INTRODUCTORY REMARKS
Let G be a group and denote by PAut G the group of power automorphisms of G (see [4]). An automorphism of G is called an I-automorphism of G if it maps every infinite subgroup of G onto itself. The set IAut G of all I-automorphisms of G is a normal subgroup of Aut G containing PAut G . IAut G has been investigated by Curzio et al. [5], where they often consider the case when IAut G = PAut G or at least IAut G is abelian.
Here we consider the structural restriction on G when IAut G = PAut G . One of the major outcomes of this work is that for many groups H in fact IAut H = PAut H holds. We also characterize infinite Chernikov groups G for which IAut G = PAut G .
π SIMILAR VOLUMES