Direct product of automorphism groups of digraphs
From MaRDI portal
Publication:5217061
DOI10.26493/1855-3974.1498.77bzbMath1439.05228OpenAlexW2774449290WikidataQ127635242 ScholiaQ127635242MaRDI QIDQ5217061
Grech, Mariusz, Wilfried Imrich, Łukasz Jan Wojakowski, Anna Dorota Krystek
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1498.77b
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76) Group actions on combinatorial structures (05E18)
Related Items (7)
Distance formula for direct-co-direct product in the case of disconnected factors ⋮ Groups for which it is easy to detect graphical regular representations ⋮ On some metric properties of direct-co-direct product ⋮ Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups ⋮ Cyclic permutation groups that are automorphism groups of graphs ⋮ Graphical representations of cyclic permutation groups ⋮ Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph multiplication
- Homogeneous factorisations of complete graphs with edge-transitive factors
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
- Finite digraphs with given regular automorphism groups
- Graphical regular representations of alternating, symmetric and miscellaneous small groups
- On graphical representations of cyclic extensions of groups
- Cartesian products of directed graphs with loops
- Direct product of automorphism groups of colored graphs
- Graphical complexity of products of permutation groups
- On the action of non-Abelian groups on graphs
- On products of graphs and regular groups
- Homogeneous factorisations of graphs and digraphs
- One-factorizations of complete graphs with vertex-regular automorphism groups
- The graphical complexity of direct products of permutation groups
- Direct products of automorphism groups of graphs
- Totally symmetric colored graphs
- On partitioning the orbitals of a transitive permutation group
- On the non-existence of graphs with transitive generalized dicyclic groups
- Graphical Regular Representations of Non-Abelian Groups, I
- Graphical Regular Representations of Non-Abelian Groups, II
- On graphical regular representations of direct products of groups
This page was built for publication: Direct product of automorphism groups of digraphs