Abstract
We consider tetravalent graphs within a family introduced by Praeger and Xu in 1989. These graphs have the property of having exceptionally large symmetry groups among all tetravalent graphs. This very property makes them unsuitable for the use of simple computer techniques. We apply techniques from coding theory to determine for which values of the parameters the graphs allow cycle structures, semitransitive orientations, or rotary maps; all without recourse to the use of computers.
Original language | English (US) |
---|---|
Pages (from-to) | 269-291 |
Number of pages | 23 |
Journal | Acta Mathematica Universitatis Comenianae |
Volume | 88 |
Issue number | 2 |
State | Published - Jun 26 2019 |
Keywords
- Cycle structure
- Graph
- Reflexible
- Regular map
- Rotary map
- Semitransitive
- Transitive
ASJC Scopus subject areas
- General Mathematics