• Title, Summary, Keyword: classification of cubic semisymmetric graphs

Search Result 1, Processing Time 0.025 seconds

SEMISYMMETRIC CUBIC GRAPHS OF ORDER 34p3

  • Darafsheh, Mohammad Reza;Shahsavaran, Mohsen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.3
    • /
    • pp.739-750
    • /
    • 2020
  • A simple graph is called semisymmetric if it is regular and edge transitive but not vertex transitive. Let p be a prime. Folkman proved [J. Folkman, Regular line-symmetric graphs, Journal of Combinatorial Theory 3 (1967), no. 3, 215-232] that no semisymmetric graph of order 2p or 2p2 exists. In this paper an extension of his result in the case of cubic graphs of order 34p3, p ≠ 17, is obtained.