3.
Classification of edge-transitive rose window graphsIstván Kovács,
Klavdija Kutnar,
Dragan Marušič, 2010, izvirni znanstveni članek
Opis: 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
Objavljeno v RUP: 15.10.2013; Ogledov: 2976; Prenosov: 93
Povezava na celotno besedilo