Supergraphs and graphical complexity of permutation groups. (Q2918545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Supergraphs and graphical complexity of permutation groups. |
scientific article; zbMATH DE number 6092192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Supergraphs and graphical complexity of permutation groups. |
scientific article; zbMATH DE number 6092192 |
Statements
8 October 2012
0 references
supergraph
0 references
automorphism group
0 references
Supergraphs and graphical complexity of permutation groups. (English)
0 references
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.
0 references
