1 paper
Stuart E. Anderson
We construct an infinite family of 6-regular graphs {Gn}n≥3 by taking n copies of the Petersen graph and wiring corresponding vertices according to an n-cycle permut…