Classification of edge-transitive rose window graphs
Povzetek
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.
Ključne besede
group;graph;rose window;vertex-transitive;edge-transitive;arc-transitive;
Podatki
| Jezik: | Angleški jezik |
|---|---|
| Leto izida: | 2010 |
| Tipologija: | 1.01 - Izvirni znanstveni članek |
| Organizacija: | UP - Univerza na Primorskem |
| UDK: | 519.17 |
| COBISS: |
1024189012
|
| ISSN: | 0364-9024 |
| Št. ogledov: | 2841 |
| Št. prenosov: | 92 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Angleški jezik |
|---|---|
| Vrsta dela (COBISS): | Delo ni kategorizirano |
| Strani: | str. 216-231 |
| Letnik: | ǂVol. ǂ65 |
| Zvezek: | ǂno. ǂ3 |
| Čas izdaje: | 2010 |
| DOI: | 10.1002/jgt.20475 |
| ID: | 1477159 |
Priporočena dela:
Classification of edge-transitive rose window graphs
2010,
ni podatka o podnaslovu
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,
ni podatka o podnaslovu
Algebraic graph theory
2017,
drugo učno gradivo
Domination in RoseWindow graphs
2021,
ni podatka o podnaslovu