Direct product and uniqueness of automorphism groups of graphs
From MaRDI portal
Publication:1817573
DOI10.1016/S0012-365X(99)00044-8zbMATH Open0943.05045MaRDI QIDQ1817573FDOQ1817573
Publication date: 5 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cited In (17)
- 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
- Separability properties of automorphisms of graph products of groups.
- Graphical complexity of products of permutation groups
- Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
- Graphical cyclic permutation groups
- Title not available (Why is that?)
- Automorphism groups of some families of bipartite graphs
- The identity problem for graph products of groups
- Rigidity of graph products of groups.
- Automorphism groups of bipartite Kneser type-\(k\) graphs
- Title not available (Why is that?)
- 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)