Graphical representations of cyclic permutation groups
From MaRDI portal
Publication:2306592
DOI10.1016/j.dam.2019.09.018zbMath1452.20001OpenAlexW2980394195WikidataQ126995576 ScholiaQ126995576MaRDI QIDQ2306592
Andrzej P. Kisielewicz, Grech, Mariusz
Publication date: 23 March 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.09.018
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (3)
On \(n\)-partite digraphical representations of finite groups ⋮ Orbit closed permutation groups, relation groups, and simple groups ⋮ Abelian permutation groups with graphical representations
Cites Work
- Finite primitive permutation groups containing a permutation having at most four cycles
- Symmetry groups of Boolean functions.
- Orbit equivalence and permutation groups defined by unordered relations.
- Graphical cyclic permutation groups
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- Homogeneous factorisations of complete graphs with edge-transitive factors
- Finite digraphs with given regular automorphism groups
- On the full automorphism group of a graph
- Symmetric graphs of order a product of two distinct primes
- Symmetry groups of Boolean functions and constructions of permutation groups
- On classifying finite edge colored graphs with two transitive automorphism groups.
- Graphical Frobenius representations
- Cayley graphs on abelian groups
- Cyclic automorphism groups of graphs and edge-colored graphs
- Direct product of automorphism groups of colored graphs
- A classification of 2-arc-transitive circulants
- Finite groups admitting an oriented regular representation
- Automorphism groups of graphs and edge-contraction. (Reprint)
- Totally symmetric colored graphs
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- The classification of minimal graphs with given abelian automorphism group
- A solution of the isomorphism problem for circulant graphs
- Classification of finite groups that admit an oriented regular representation
- Direct product of automorphism groups of digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphical representations of cyclic permutation groups