Rose window graphs underlying rotary maps

Kovács, István; Kutnar, Klavdija; Ruff, János

ENG

Prijava

Prva stran / Izpis gradiva

Izpis gradiva

A- | A+ | Natisni

Naslov:	Rose window graphs underlying rotary maps
Avtorji:	ID Kovács, István (Avtor) ID Kutnar, Klavdija (Avtor) ID Ruff, János (Avtor)
Datoteke:	http://dx.doi.org/10.1016/j.disc.2009.12.010
Jezik:	Angleški jezik
Vrsta gradiva:	Delo ni kategorizirano
Tipologija:	1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:	IAM - Inštitut Andrej Marušič
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+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.
Ključne besede:	graph theory, rotary map, edge-transitive graph, covering graph, voltage graph
Leto izida:	2010
Št. strani:	str. 1802-1811
Številčenje:	Vol. 310, no. 12
PID:	20.500.12556/RUP-1173
ISSN:	0012-365X
UDK:	519.17
COBISS.SI-ID:	1024195924
Datum objave v RUP:	15.10.2013
Število ogledov:	4440
Število prenosov:	90
Metapodatki:
:	KOVÁCS, István, KUTNAR, Klavdija in RUFF, János, 2010, Rose window graphs underlying rotary maps. V : [na spletu]. Objavljeni znanstveni prispevek na konferenci. 2010. p. 1802–1811. [Dostopano 5 april 2025]. Pridobljeno s: http://dx.doi.org/10.1016/j.disc.2009.12.010 Kopiraj citat