Title of article :
Constructing Infinite One-regular Graphs
Author/Authors :
Malni?، نويسنده , , Aleksander and Maru?i?، نويسنده , , Dragan and Seifter، نويسنده , , Norbert، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
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.
Journal title :
European Journal of Combinatorics
Journal title :
European Journal of Combinatorics
