VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Classification of edge-transitive rose window graphs
    Kovács, István, 1969- ; Kutnar, Klavdija, 1980- ; Marušič, Dragan
    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.
    Vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 65, no. 3, 2010, str. 216-231)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2010
    Jezik - angleški
    COBISS.SI-ID - 1024189012

    Povezava(-e):

    http://dx.doi.org/10.1002/jgt.20475
    Repozitorij Univerze na Primorskem - RUP
    DOI

vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 65, no. 3, 2010, str. 216-231)
loading ...
loading ...
loading ...

Vnos na polico