semisymmetric cubic graphs of order 34p3
Bull. Korean Math. Soc.
Published online January 9, 2020
Mohammad Reza Darafsheh and Mohsen Shahsavaran
University of Tehran
Abstract : 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 2p^2 exists. In this paper an extension of his result in the case
of cubic graphs of order 34p^3, p not equal to 17, is obtained.
Keywords : edge-transitive graph, vertex-transitive graph, semisymmetric graph, order of a graph, classification of cubic semisymmetric graphs
MSC numbers : 05E18, 20D60, 05C25, 20B25
Full-Text :

   

Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd