Infinitely many finite one-regular graphs of any even valency

A graph is said to be one-regular if its automorphism group acts regularly on the arc set. For any integer k⩾2, a construction of an infinite family of one-regular graphs of valency 2k is given. All of them are Cayley graphs on dihedral groups with girth 4 and cyclic vertex stabilizer.