| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653459 | European Journal of Combinatorics | 2015 | 6 Pages |
Abstract
A regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive. In this paper, we give a complete list of connected semisymmetric cubic graph of square-free order, which consists of one single graph of order 210 and four infinite families of such graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gui Xian Liu, Zai Ping Lu,