Graphs with girth at least 5 with orders between 20 and 32

We prove properties of extremal graphs of girth 5 and order 20 ≤
v ≤ 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for tractable search for and identification of all non isomorphic cases.