Direct product and uniqueness of automorphism groups of graphs
From MaRDI portal
Recommendations
Cited in
(20)- Permutation groups on unordered sets. II: On a theorem of Frucht
- The graphical complexity of direct products of permutation groups
- Direct products of automorphism groups of graphs
- Cyclic permutation groups that are automorphism groups of graphs
- Symmetry groups of Boolean functions and constructions of permutation groups
- Graph representation of permutation groups. I.
- Direct product of automorphism groups of digraphs
- Separability properties of automorphisms of graph products of groups.
- Graphical complexity of products of permutation groups
- Graphical cyclic permutation groups
- Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
- scientific article; zbMATH DE number 3843783 (Why is no real title available?)
- The identity problem for graph products of groups
- Automorphism groups of some families of bipartite graphs
- On a representation of the automorphism group of a graph in a unimodular group
- Rigidity of graph products of groups.
- scientific article; zbMATH DE number 1052830 (Why is no real title available?)
- Automorphism groups of bipartite Kneser type-\(k\) graphs
- All self-complementary symmetric graphs
- Direct product of automorphism groups of colored graphs
This page was built for publication: Direct product and uniqueness of automorphism groups of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817573)
