Rose window graphs

Authors

  • Stephen E. Wilson Northern Arizona University

DOI:

https://doi.org/10.26493/1855-3974.13.5bb

Keywords:

graph, automorphism group, symmetry, edge-transitive graph, regular map, tetravalent graph, rose window

Abstract

This paper introduces a family of tetravalent graphs called ";rose window graphs";, denoted R_n(a, r), and investigates their symmetry properties. Four families of these graphs are shown to be edge-transitive and it is conjectured that every R_n(a, r) which is edged-transitive belongs to one of these families. Proofs and conjectures about the size of a dart-stabilizer and about regular maps containing these graphs are also offered.

Downloads

Published

2008-06-17

Issue

Vol. 1 No. 1 (2008)

Section

Special Issue Bled'07

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/