Abstract
A regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. Let p be a prime. By Folkman [J. Combin. Theory 3 (1967), 215–232], there is no cubic semisymmetric graph of order 2p or 2p2, and by Hua et al. [Science in China A 54 (2011), 1937–1949], there is no cubic semisymmetric graph of order 4p2. Lu et al. [Science in China A 47 (2004), 11–17] classified connected cubic semisymmetric graphs of order 6p2. In this paper, for p > q ≥ 5 two distinct odd primes, it is shown that the sufficient and necessary conditions which a connected cubic edge transitive bipartite graph of order 2qp2 is semisymmetric.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Acta Mathematicae Applicatae Sinica, English Series
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
