Generating r-regular graphs Original Research Article

For each nonnegative integer r, we determine a set of graph operations such that all r-regular loopless graphs can be generated from the smallest r-regular loopless graphs by using these operations. We also discuss possible extensions of this result to r-regular graphs of girth at least g, for each fixed g.