AbstractA 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
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
AbstractA graph is one-regular if its automorphism group acts regularly on the set of arcs of the gr...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
A graph is said to be one-regular if its automorphism group acts regularly on the arc set. For any i...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the set of its...
AbstractA graph is said to beone-regularif its automorphism group acts regularly on the set of its a...
AbstractA graph is said to beone-regularif its automorphism group acts regularly on the set of its a...
A graph is said to be one-regular if its automorphism group acts transitively and freely on the arc ...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
The existence of 1-factorizations of an infinite complete equipartite graph (Formula presented.) (wi...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the arc set. F...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J Comb...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
AbstractA graph is one-regular if its automorphism group acts regularly on the set of arcs of the gr...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
A graph is said to be one-regular if its automorphism group acts regularly on the arc set. For any i...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the set of its...
AbstractA graph is said to beone-regularif its automorphism group acts regularly on the set of its a...
AbstractA graph is said to beone-regularif its automorphism group acts regularly on the set of its a...
A graph is said to be one-regular if its automorphism group acts transitively and freely on the arc ...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
The existence of 1-factorizations of an infinite complete equipartite graph (Formula presented.) (wi...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the arc set. F...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J Comb...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
AbstractA graph is one-regular if its automorphism group acts regularly on the set of arcs of the gr...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
DOI
Add to ORKG