Automorphism groups of graphs with 1-factorizations (Q1815305): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q114215605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry Groups of Coloured Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automorphism groups of pictures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5771659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs of Degree Three with a Given Abstract Group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3337492 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512231 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:37, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automorphism groups of graphs with 1-factorizations |
scientific article |
Statements
Automorphism groups of graphs with 1-factorizations (English)
0 references
7 April 1997
0 references
A colouring \(\phi\) of a graph \(G\) is a mapping from the edge set of \(G\) onto a set \(\Phi\) of colours. Proper colourings are characterized by the property that any two adjacent edges receive different colours. A perfect colouring \(\phi\) of \(G\) is a proper colouring, such that for every pair \((v,\alpha)\) of \(V(G)\times \Phi\) there is exactly one edge in \(G\) coloured \(\alpha\) and incident with \(v\). Perfect colourings are also called 1-factorizations. All colour-preserving automorphisms of \(G\) related to \(\phi\) constitute a subgroup \(A_c(G,\phi)\) of \(\Aut(G)\). Theorem 1. Let \(H\) be a finitely generated group. Then there is a connected graph \(G\) of degree 3 with 1-factorization \(\phi\) such that \(A_c(G,\phi)\) is isomorphic to \(H\). Theorem 2. Let \(H\) be a finitely generated group. Then there is a regular graph \(G\) of degree 5 such that every subgroup of \(H\) is isomorphic to a group \(A_c(G,\phi)\) for some 1-factorization \(\phi\) of \(G\).
0 references
automorphism group
0 references
colouring
0 references
1-factorizations
0 references
finite generated group
0 references