Constructing Infinite One-Regular Graphs
This paper is made freely available by the publisher.
Full text: Download
Published version:
archiving forbidden
Data provided by 
Abstract
A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.