Semisymmetric cubic graphs of twice odd order

Abstract

Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric… (More)
DOI: 10.1016/j.ejc.2005.06.007

3 Figures and Tables

Topics

  • Presentations referencing similar topics