Graphical representations of cyclic permutation groups
From MaRDI portal
Publication:2306592
The authors obtain a necessary and sufficient condition that a permutation group generated by a single permutation is an automorphism group of an edge-colored graph.
Recommendations
- Graphical cyclic permutation groups
- Abelian permutation groups with graphical representations
- Permutability graph of cyclic subgroups
- Permutability graph of cyclic subgroups of some finite groups
- Representation of Permutation Groups by Coloured Graphs
- Cyclic permutation groups that are automorphism groups of graphs
- Graph representation of permutation groups. I.
- Computational Science - ICCS 2004
- On permutable cyclic graph of finite groups.
- Permutations over cyclic groups
Cites work
- A classification of 2-arc-transitive circulants
- A solution of the isomorphism problem for circulant graphs
- Automorphism groups of circulant graphs -- a survey
- Automorphism groups of graphs and edge-contraction. (Reprint)
- Cayley graphs on abelian groups
- Classification of finite groups that admit an oriented regular representation
- Cyclic automorphism groups of graphs and edge-colored graphs
- Direct product of automorphism groups of colored graphs
- Direct product of automorphism groups of digraphs
- Finite digraphs with given regular automorphism groups
- Finite groups admitting an oriented regular representation
- Finite primitive permutation groups containing a permutation having at most four cycles
- Graphical cyclic permutation groups
- Graphical Frobenius representations
- Homogeneous factorisations of complete graphs with edge-transitive factors
- scientific article; zbMATH DE number 3646933 (Why is no real title available?)
- scientific article; zbMATH DE number 3943825 (Why is no real title available?)
- scientific article; zbMATH DE number 3752875 (Why is no real title available?)
- scientific article; zbMATH DE number 3603312 (Why is no real title available?)
- scientific article; zbMATH DE number 556252 (Why is no real title available?)
- scientific article; zbMATH DE number 4374 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- On classifying finite edge colored graphs with two transitive automorphism groups.
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- On the full automorphism group of a graph
- Orbit equivalence and permutation groups defined by unordered relations.
- Supergraphs and graphical complexity of permutation groups.
- Symmetric graphs of order a product of two distinct primes
- Symmetry groups of Boolean functions and constructions of permutation groups
- Symmetry groups of Boolean functions.
- The classification of minimal graphs with given abelian automorphism group
- Totally symmetric colored graphs
Cited in
(12)- Abelian permutation groups with graphical representations
- On \(n\)-partite digraphical representations of finite groups
- Cyclic permutation groups that are automorphism groups of graphs
- The distinguishing number of the direct product and wreath product action.
- On orbit closures of groups.
- The graphical complexity of direct products of permutation groups
- Representation of Permutation Groups by Coloured Graphs
- Graphical cyclic permutation groups
- scientific article; zbMATH DE number 2158187 (Why is no real title available?)
- scientific article; zbMATH DE number 4374 (Why is no real title available?)
- Graph representation of permutation groups. I.
- Orbit closed permutation groups, relation groups, and simple groups
This page was built for publication: Graphical representations of cyclic permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306592)