Abstract. As opposded to famous degree/diameter problem, for given d and k we determine the smallest order of a graph of diameter k in which all vertices have degree d.