Dirichlet Character Difference Graphs

We define Dirichlet character difference graphs and describe their basic properties, including the enumeration of triangles. In the case where the modulus is an odd prime, we exploit the spectral properties of such graphs in order to provide meaningful upper bounds for their diameter.