Abstract
We define Dirichlet character difierence 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.
| Original language | English |
|---|---|
| Pages (from-to) | 21-28 |
| Number of pages | 8 |
| Journal | Acta Mathematica Universitatis Comenianae |
| Volume | 82 |
| Issue number | 1 |
| State | Published - 2013 |
Keywords
- Cayley graphs
- Circulant matrices
- Paley graphs