I need to build a graph with $N$ vertices such that each vertex has degree at least $k$ and the graph has the smallest diameter. What algorithm can I use?
Constructing a graph of min-degree k with the smallest diameter possible
graph theory