Regular graphs with given girth pair

Authors


Abstract

The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair is proved and simple bounds for their smallest order are developed. Several infinite classes of such graphs are constructed and it is proved that two of these families consist of smallest graphs.

Ancillary