Classification of edge-transitive rose window graphs
Abstract
Given natural numbers ▫$n \ge 3$▫ and ▫$1 \le a$▫, ▫$r \le n-1$▫, the rose window graph ▫$R_n(a,r)$▫ is a quartic graph with vertex set ▫$\{x_i \vert i \in {\mathbb Z}_n\} \cup \{y_i \vert i \in {\mathbb Z}_n\}$▫ and edge set ▫$\{\{x_i, x_{i+1}\} \vert i \in {\mathbb Z}_n\} \cup \{\{y_i, y_{i+r}\} \vert i \in {\mathbb Z}_n\} \cup \{\{x_i, y_i\} \vert i \in {\mathbb Z}_n\} \cup \{\{x_{i+a}, y_i\} \vert i \in {\mathbb Z}_n\}$▫. In this article a complete classification of edge-transitive rose window graphs is given, thus solving one of three open problems about these graphs posed by Steve Wilson in 2001.
Keywords
group;graph;rose window;vertex-transitive;edge-transitive;arc-transitive;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2010 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UP - University of Primorska |
| UDC: | 519.17 |
| COBISS: |
1024189012
|
| ISSN: | 0364-9024 |
| Views: | 2841 |
| Downloads: | 92 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Type (COBISS): | Not categorized |
| Pages: | str. 216-231 |
| Volume: | ǂVol. ǂ65 |
| Issue: | ǂno. ǂ3 |
| Chronology: | 2010 |
| DOI: | 10.1002/jgt.20475 |
| ID: | 1477159 |
Recommended works:
Classification of edge-transitive rose window graphs
2010,
no subtitle data available
Edge-transitive Rose Window graphs
2008,
Group Theory Seminar, 21.5.2008, Ohio State University, Columbus, Ohio, USA
Rose window graphs underlying rotary maps
2010,
no subtitle data available
Algebraic graph theory
2017,
drugo učno gradivo
Domination in RoseWindow graphs
2021,
no subtitle data available