(UL)
  • On cubic graphs admitting an edge-transitive solvable group
    Malnič, Aleksander ; Marušič, Dragan ; Potočnik, Primož, 1971-
    Using covering graph techniques, a structural result about connected cubic simple graphs admitting an edge-transitive solvable group of automorphisms is proved. This implies, among others, that every ... such graph can be obtained from either the 3-dipole Dip▫$_3$▫ or the complete graph ▫$K_4$▫, by a sequence of elementary abelian covers. Another consequence of the main structural results is that the action of an arc-transitive solvable group on a connected cubic simple graph is at most 3-arc-transitive. As an application, a new infinite family of semisymmetric cubic graphs, arising as regular elementary abelian covering projections of ▫$K_{3,3}$▫, is constructed.
    Vir: Journal of algebraic combinatorics. - ISSN 0925-9899 (Vol. 20, no. 1, 2004, str. 99-113)
    Vrsta gradiva - članek, sestavni del
    Leto - 2004
    Jezik - angleški
    COBISS.SI-ID - 13267033

vir: Journal of algebraic combinatorics. - ISSN 0925-9899 (Vol. 20, no. 1, 2004, str. 99-113)

loading ...
loading ...
loading ...