• Title of article

    Hexavalent half-arc-transitive graphs of order

  • Author/Authors

    Wang، نويسنده , , Xiuyun and Feng، نويسنده , , Yan-Quan، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    8
  • From page
    1263
  • To page
    1270
  • Abstract
    A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set and edge set, but not arc set. It was shown by [Y.-Q. Feng, K.S. Wang, C.X. Zhou, Tetravalent half-transitive graphs of order 4p, European J. Combin. 28 (2007) 726–733] that all tetravalent half-arc-transitive graphs of order 4 p for a prime p are non-Cayley and such graphs exist if and only if p − 1 is divisible by 8. In this paper, it is proved that each hexavalent half-arc-transitive graph of order 4 p is a Cayley graph and such a graph exists if and only if p − 1 is divisible by 12, which is unique for a given order. This result contributes to the classification of half-arc-transitive graphs of order 4 p of general valencies.
  • Journal title
    European Journal of Combinatorics
  • Serial Year
    2009
  • Journal title
    European Journal of Combinatorics
  • Record number

    1549003