The following table lists the currently known values for the number of vertices in a cubic cage. For certain small values of g the cages themselves are all known, and are given here explicitly. For larger values of g a range is given - the lower value is either the trivial Moore bound n(3,g) or a bound that has been increased by extensive computation, while the upper bound is simply the size of the smallest known cubic graph of that girth, which is given explicitly.

Under the column labeled Number is listed the number of graphs known that meet the upper bound. Numbers not known to be exact are followed by a + symbol (so 1+ means that one example is known, but there may be more).