✦ LIBER ✦

Representation of Permutation Groups by Coloured Graphs

✍ Scribed by Ulrike Baumann

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 432 KB
Volume: 158
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19921580114

No coin nor oath required. For personal study only.

✦ Synopsis

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 permutation groups being full groups of colour preserving automorphisms for some kinds of proper edge colourings.

📜 SIMILAR VOLUMES

Symmetry Groups of Coloured Graphs

✍ Ulrike Baumann 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

## Abstract A perfect colouring Φ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis

Representing Groups by Colourings of Gra

Representing Groups by Colourings of Graphs

✍ Ulrike Baumann 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Groups without Faithful Transitive Permu

Groups without Faithful Transitive Permutation Representations of Small Degree

✍ László Babai; Albert J. Goodman; László Pyber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 328 KB

A subgroup H of a group G is core-free if H contains no non-trivial normal subgroup of G, or equivalently the transitive permutation representation of G on the cosets of H is faithful. We study the obstacles to a group having large core-free subgroups. We call a subgroup D a ''dedekind'' subgroup of

Finitary Representations and Images of T

Finitary Representations and Images of Transitive Finitary Permutation Groups

✍ Felix Leinen; Orazio Puglisi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 190 KB

We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.

Quasi-permutation Representations of the

Quasi-permutation Representations of the Group GL2(q)

✍ M.R Darafsheh; M Ghorbany; A Daneshkhah; H Behravesh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A square matrix over the complex field with non-negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful Ž . permutation representation of G is denoted by p G . The minimal degree of a faithful representation of G by quasi-permutation matric

A labeling scheme for young tableaux spa

A labeling scheme for young tableaux spanning representations of permutation groupS(N)

✍ Sarma, C. R.; Nampoothiri, A. V. V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB

A structure-dependent labeling scheme for the Standard Young Tableaux spanning the representations of the permutation group is outlined in the present work. This scheme is used to generate the representations of a select class of permutations such as dense cycles and general transpositions of the gr