Dirichlet Character Difference Graphs
Main Article Content
Abstract
We define Dirichlet character difference graphs and describe their basic properties, including the enumeration of triangles and edge-disjoint hamiltonian cycles. 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.
Article Details
How to Cite
Budden, M., Calkins, N., Hack, W., Lambert, J., & Thompson, K.
(2017).
Dirichlet Character Difference Graphs.
Acta Mathematica Universitatis Comenianae, 82(1), 21-28.
Retrieved from http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/727/482
Issue
Section
Articles