The degree-diameter problem is concerned with finding the largest possible degree for a graph of a given diameter.