István Kovács (Author), Klavdija Kutnar (Author), János Ruff (Author)

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+1}\} \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 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.

Keywords

teorija grafov;povezavno tranzitiven graf;krovni graf;napetostni graf;graph theory;rotary map;edge-transitive graph;covering graph;voltage graph;

Data

Language: English
Year of publishing:
Typology: 1.08 - Published Scientific Conference Contribution
Organization: UP - University of Primorska
UDC: 519.17
COBISS: 1024195924 Link will open in a new window
ISSN: 0012-365X
Views: 3392
Downloads: 87
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary keywords: teorija grafov;povezavno tranzitiven graf;krovni graf;napetostni graf;
Type (COBISS): Not categorized
Pages: str. 1802-1811
Volume: ǂVol. ǂ310
Issue: ǂno. ǂ12
Chronology: 2010
DOI: 10.1016/j.disc.2009.12.010
ID: 1477162
Recommended works:
, no subtitle data available
, no subtitle data available
, drugo učno gradivo
, no subtitle data available
, Group Theory Seminar, 21.5.2008, Ohio State University, Columbus, Ohio, USA