Totally symmetric colored graphs
From MaRDI portal
Recommendations
- All self-complementary symmetric graphs
- Self-complementary symmetric graphs
- scientific article; zbMATH DE number 819125
- A classification of symmetric graphs of order 3p
- Chromatic automorphisms and symmetries of some graphs
- Almost rank three graphs
- Characterization of self-complementary symmetric digraphs
- scientific article; zbMATH DE number 3889559
- All totally symmetric colored graphs
- scientific article; zbMATH DE number 1548999
Cites work
- All self-complementary symmetric graphs
- Automorphism groups of designs
- Characterization of self-complementary symmetric digraphs
- Direct product of automorphism groups of colored graphs
- Finite Permutation Groups and Finite Simple Groups
- Graphical complexity of products of permutation groups
- Homogeneous factorisations of complete graphs with edge-transitive factors
- scientific article; zbMATH DE number 1792661 (Why is no real title available?)
- scientific article; zbMATH DE number 2152953 (Why is no real title available?)
- On classifying finite edge colored graphs with two transitive automorphism groups.
- On partitioning the orbitals of a transitive permutation group
- On Sylow Subgraphs of Vertex-Transitive Self-Complementary Graphs
- Pseudo-random properties of self-complementary symmetric graphs
- SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS
- Solvable Primitive Permutation Groups of Low Rank
- Solvable, flag-transitive, rank 3 collineation groups
- Supergraphs and graphical complexity of permutation groups.
- Symmetry groups of Boolean functions and constructions of permutation groups
- The Affine Permutation Groups of Rank Three
- The Flag-Transitive Collineation Groups of the Finite Desarguesian Affine Planes
Cited in
(15)- Point-color-symmetric graphs with a prime number of vertices
- Schubert graphs, symmetric groups and flags of Boolean lattices
- On classifying finite edge colored graphs with two transitive automorphism groups.
- Abelian permutation groups with graphical representations
- Cyclic permutation groups that are automorphism groups of graphs
- Graphical representations of cyclic permutation groups
- Graphical complexity of products of permutation groups
- The graphical complexity of direct products of permutation groups
- scientific article; zbMATH DE number 568833 (Why is no real title available?)
- Graphical cyclic permutation groups
- Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
- Direct product of automorphism groups of digraphs
- All totally symmetric colored graphs
- Large totally symmetric sets
- Regular symmetric groups of Boolean functions.
This page was built for publication: Totally symmetric colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652560)
