Regular separable graphs of minimum order with given diameter

A (d, c, v)-graph G is one which is regular of degree v and has diameter d and connectivity c. G is said to be minimum if it is of minimum order, i.e. has the minimumnumber of points; G is separable if c=1.In this paper, the minimum order of a (d, 1, v)-graph is determined and the construction of all minimum (d, 1, v)-graphs is described.