Rose window graphs underlying rotary maps

Given natural numbers n≥3 and 1≤a,r≤n−1, the rose window graph R_n(a,r) is a quartic graph with vertex set {x_i∣i∈Z_n}∪{y_i∣i∈Z_n} and edge set {{x_i,x_i+1}∣i∈Z_n}∪{{y_i,y_i+r}∣i∈Z_n}∪{{x_i,y_i}∣i∈Z_n}∪{{x_i+a,y_i}∣i∈Z_n}. In this paper rotary maps on rose window graphs are considered. In particular, we answer the question posed in S. Wilson, Rose window graphs, Ars Math. Contemp. 1 (2008), 7-19. http://amc.imfm.si/index.php/amc/issue/view/5] concerning which of these graphs underlie a rotary map.