VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
PDF
  • The classification of half-arc-transitive generalizations of Bouwer graphs
    Ramos Rivera, Alejandra ; Šparl, Primož
    A graph is said to be half-arc-transitive if its automorphism group acts transitively on its vertex set and its edge set, but not on its arc set. In 1970 I. Z. Bouwer constructed an infinite family ... of vertex- and edge-transitive graphs for each even valence greater than 2 and proved that a subfamily of the constructed graphs, containing one graph for each even valence greater than 2, consists of half-arc-transitive graphs. In a recent paper Conder and Žitnik gave a complete classification of the half-arc-transitive Bouwer graphs. In this paper we generalize the Bouwer graphs to obtain a much larger family of vertex- and edge-transitive graphs, containing almost all so-called tightly attached quartic half-arc-transitive graphs. We give a complete classification of the half-arc-transitive members of this new family of graphs. All half-arc-transitive members are tightly attached.
    Vir: European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik. - ISSN 0195-6698 (Vol. 64, 2017, str. 88-112)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2017
    Jezik - angleški
    COBISS.SI-ID - 18045273

    Povezava(-e):

    http://dx.doi.org/10.1016/j.ejc.2017.04.003
    DOI

Vnos na polico