Premium
Representation of Permutation Groups by Coloured Graphs
Author(s) -
Baumann Ulrike
Publication year - 1992
Publication title -
mathematische nachrichten
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 50
eISSN - 1522-2616
pISSN - 0025-584X
DOI - 10.1002/mana.19921580114
Subject(s) - mathematics , automorphism , combinatorics , permutation graph , permutation (music) , graph , enhanced data rates for gsm evolution , permutation group , cyclic permutation , representation (politics) , discrete mathematics , symmetric group , computer science , artificial intelligence , physics , politics , acoustics , political science , law
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 permutation groups being full groups of colour preserving automorphisms for some kinds of proper edge colourings.