Supergraphs and graphical complexity of permutation groups.
From MaRDI portal
A new structure called supergraph is proposed: its superedges are recursively defined as pairs of vertices and/or previously obtained superedges. It is shown that every permutation group acting on a set of vertices is an automorphisn group of a suitable supergraph built on the same set.NEWLINENEWLINEIn addition, the author studies a new parameter called graphical complexity, which is the length of the maximal inclusion chain of a supergraph representing given group.
Recommendations
Cited in
(17)- Cyclic automorphism groups of graphs and edge-colored graphs
- 2-closed abelian permutation groups
- Direct product of automorphism groups of colored graphs
- 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
- Modes, modals, and barycentric algebras: a brief survey and an additivity theorem
- Superpositional graphs
- Direct products of automorphism groups of graphs
- Totally symmetric colored graphs
- Symmetry groups of Boolean functions.
- 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
- Graph representation of permutation groups. I.
- Geometric groups of second order and related combinatorial structures
This page was built for publication: Supergraphs and graphical complexity of permutation groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918545)
