×

A classification of the cubic semisymmetric graphs of order \(34p^2\). (English) Zbl 1244.05069

Summary: A simple undirected graph is called semisymmetric if it is regular and edge transitive but not vertex-transitive. In this paper, we classify all connected cubic semisymmetric graph of order \(34p^2\), where \(p\) be a prime.

MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDFBibTeX XMLCite
Full Text: DOI