Full text: Download
A graph is said to beone-regularif its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of one-regular graphs of valency 4 with vertex stabilizerZ22having a non-solvable group of automorphisms is given. The smallest graph in this family has 60 vertices.