Abstract
A finite graph is one-regular if its automorphism group acts regularly on the set of its arcs. In the present paper, tetravalent one-regular graphs of order 7p2, where p is a prime, are classified using computer algebra tools.
You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026
Select search scope: search across all journals or within the current journal
A finite graph is one-regular if its automorphism group acts regularly on the set of its arcs. In the present paper, tetravalent one-regular graphs of order 7p2, where p is a prime, are classified using computer algebra tools.