Small bi-regular graphs of even girth

A graph of girth gg that contains vertices of degrees rr and mm is called a bi-regular ({r,m},g)({r,m},g)-graph. As with the Cage Problem  , we seek the smallest ({r,m},g)({r,m},g)-graphs for given parameters 2≤r