Infinitely many finite one-regular graphs of any even valency

https://doi.org/10.1016/S0095-8956(03)00084-4Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

One-regular graph
Cayley graph
Dihedral group

Cited by (0)

Supported by Com2MaC-KOSEF in Korea.