Rose window graphs underlying rotary maps

被引：12

作者：

Kovacs, Istvan ^{[1
]}

Kutnar, Klavdija ^{[1
]}

Janos Ruff ^{[2
]}

机构：

[1] Univ Primorska, FAMNIT, Koper 6000, Slovenia

[2] Univ Pecs, MII, H-6722 Pecs, Hungary

来源：

DISCRETE MATHEMATICS | 2010年 / 310卷 / 12期

关键词：

Rotary map; Edge-transitive graph; Covering graph; Voltage graph; REGULAR MAPS; COVERINGS;

D O I：

10.1016/j.disc.2009.12.010

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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) vertical bar i is an element of Z(n)) boolean OR {y(i) vertical bar i is an element of Z(n)} and edge set {{x(i), x(i+1)} vertical bar i is an element of Z(n)} boolean OR {{y(i), y(i+r)} vertical bar i is an element of Z(n)} boolean OR {{x(i), y(i)} vertical bar i is an element of z(n)} boolean OR vertical bar i is an element of 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. (C) 2010 Published by Elsevier B.V.

引用

页码：1802 / 1811

页数：10