The graphical complexity of direct products of permutation groups
From MaRDI portal
Publication:3168660
DOI10.1002/jgt.20504zbMath1294.05073OpenAlexW2039864907MaRDI QIDQ3168660
Publication date: 19 April 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20504
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Graphical cyclic permutation groups, Cyclic permutation groups that are automorphism groups of graphs, Direct product of automorphism groups of digraphs, Direct products of automorphism groups of graphs, Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
Cites Work
- Unnamed Item
- Homogeneous factorisations of complete graphs with edge-transitive factors
- 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
- Direct product and uniqueness of automorphism groups of graphs
- Direct product of automorphism groups of colored graphs
- Graphical complexity of products of permutation groups
- On the action of non-Abelian groups on graphs
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Direct products of automorphism groups of graphs
- Totally symmetric colored graphs
- 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
- All self-complementary symmetric graphs
