✦ LIBER ✦

Graphs and finite permutation groups. II

✍ Scribed by Charles C. Sims

Publisher: Springer-Verlag
Year: 1968
Tongue: French
Weight: 333 KB
Volume: 103
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf01114994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs and finite permutation groups

✍ Charles C. Sims 📂 Article 📅 1967 🏛 Springer-Verlag 🌐 French ⚖ 624 KB

Mutually Permutable Products of Finite G

Mutually Permutable Products of Finite Groups, II

✍ A. Ballester-Bolinches; M.C. Pedraza-Aguilera 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 81 KB

On a graph related to permutability in f

✍ A. Ballester-Bolinches; John Cossey; R. Esteban-Romero 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 108 KB

Transitive permutation groups and groups

Transitive permutation groups and groups with finite derived groups

✍ J. A. H. Shepperd; James Wiegold 📂 Article 📅 1963 🏛 Springer-Verlag 🌐 French ⚖ 375 KB

Representation of Permutation Groups by

Representation of Permutation Groups by Coloured Graphs

✍ Ulrike Baumann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

## Abstract The topic of this paper is representing permutation groups by connected graphs with proper edge colourings. Every connected graph __G__ with a proper edge colouring ϕ determines a group __A~c~__(__G__, ϕ) of graph automorphisms which preserve the colours of the edges. We characterize pe

On Permutation Groups of Finite Type

✍ Clara Franchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A permutation group G is said to be a group of finite type {k}, k a positive integer, if each nonidentity element of G has exactly k fixed points. We show that a group G can be faithfully represented as an irredundant permutation group of finite type if and only if G has a non-trivial normal partiti