Constructing digraphs with large diameter and small number of distinct eigenvalues

We examine primarily regular digraphs with large diameter and a small number of eigenvalues of the adjacency matrix.
In the diagonalizable cases the diameter is less than the number of distinct eigenvalues, but we know that this fails in nilpotent instances. We focus on nilpotent Cayley graphs to highlight this effect.