Abstract

A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. In this paper we classify all connected cubic semisymmetric graphs of order 20p, p prime.

DOI

10.3906/mat-1904-165

Keywords

Edge-transitive graph, vertex-transitive graph, semisymmetric graph, order of a graph, classification of cubic semisymmetric graphs

First Page

2755

Last Page

2766

Recommended Citation

SHAHSAVARAN, M, & DARAFSHEH, M. R (2019). Classifying semisymmetric cubic graphs of order 20p. Turkish Journal of Mathematics 43 (6): 2755-2766. https://doi.org/10.3906/mat-1904-165

Download