Given $d$, $k$ and $n$ of a graph G where
$n$: the number of vertices in G,
$d$: the maximum vertex-degree in G,
$n$: the exact diameter of G,
what is maximum possible $|E|$ ? That is, what is the maximum number of edges in a graph that has the values $(d, k, n)$ as given ?
I am looking for references to this solution in literature.
Note that this is different than the degree-diameter problem -- the problem of finding maximum $|V|$ on given $(d,k)$ which is bounded by Moore's value.
Also note: I am aware of the "minimum", rather than "maximum $|E|$" version of this problem which has solutions for $k=2$ and $k=3$ in literature.
Thanks in advance.