Recursive constructions of small regular graphs of given degree and girth

We revisit and generalize a recursive construction due to Sachs involving two graphs which increases the girth of one graph and the degree of the other. We investigate the properties of the resulting graphs in the context of cages and construct families of small graphs using geometric graphs, Paley graphs, and techniques from the theory of Cayley maps.