✦ LIBER ✦

Symmetry Groups of Coloured Graphs

✍ Scribed by Ulrike Baumann

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 474 KB
Volume: 163
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19931630109

No coin nor oath required. For personal study only.

✦ Synopsis

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 automorphisms, which preserve the structure of the colouring, and characterize these groups up to isomorphism. Our considerations are based on the fact that every perfectly coloured graph is isomorphic to a Schreier coset graph on a group generated by involutions.

📜 SIMILAR VOLUMES

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

Representing Groups by Colourings of Gra

Representing Groups by Colourings of Graphs

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

Circular Colouring and Orientation of Gr

Circular Colouring and Orientation of Graphs

✍ Xuding Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

This paper proves that if a graph G has an orientation D such that for each cycle C with djCj ðmod kÞ 2 f1; 2; . . . ; 2d À 1g we have jCj=jC þ j4k=d and jCj=jC À j4k=d; then G has a ðk; dÞ-colouring and hence w c ðGÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19

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.

Symmetry Groups of Boolean Functions and

Symmetry Groups of Boolean Functions and Constructions of Permutation Groups

✍ Andrzej Kisielewicz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 273 KB

In this paper we deal with the symmetry group S f of a boolean function f on n-variables, that is, the set of all permutations on n elements which leave f invariant. The main problem is that of concrete representation: which permutation Ž . groups on n elements can be represented as G s S f for some

Group labelings of graphs

✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such