AbstractA 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
A 1-factorization of a complete graph is said to be regular if it admits an automorphism group with ...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
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 ...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the set of its...
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...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the arc set. F...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
A 1-factorization of a complete graph is said to be regular if it admits an automorphism group with ...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
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 ...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the set of its...
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...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractA graph is one-regular if its automorphism group acts freely and transitively on the set of ...
AbstractA graph is said to be one-regular if its automorphism group acts regularly on the arc set. F...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
A 1-factorization of a complete graph is said to be regular if it admits an automorphism group with ...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
DOI
Add to ORKG