I need to build a graph with number of vertexes N such that each vertex has degree at least k and the graph has the smallest diameter. I believe that this question should be well studied.
EDIT: yes complete graph is an answer, but not interesting. I am changing the question a little bit: each vertex has degree k.