English

Walks on Unitary Cayley Graphs and Applications

Combinatorics 2012-03-13 v1 Number Theory

Abstract

In this paper, we determine an explicit formula for the number of walks in Xn=Cay(Zn,Un)X_n = \textsf{Cay}(\mathbb{Z}_n,\mathbb{U}_n), the unitary Cayley Graphs of order nn, between any pair of its vertices. With this result, we give the number of representations of a fixed residue class modn\bmod{}n as the sum of kk units of Zn\mathbb{Z}_n.

Keywords

Cite

@article{arxiv.1203.2473,
  title  = {Walks on Unitary Cayley Graphs and Applications},
  author = {Elias Cancela and Daniel A. Jaume and Adrián Pastine and Denis Videla},
  journal= {arXiv preprint arXiv:1203.2473},
  year   = {2012}
}
R2 v1 2026-06-21T20:32:35.945Z