On the order of graphs with a given girth pair

A (k;g,h)-graph is a k-regular graph of girth pair (g,h) where g is the girth of the graph, h is the length of a smallest cycle of different parity than g and g