Algebraic Cayley graphs over finite fields
- Author(s): Lu, M
- Wan, D
- Wang, LP
- Zhang, XD
- et al.
Published Web Locationhttps://doi.org/10.1016/j.ffa.2014.01.014
A new algebraic Cayley graph is constructed using finite fields. It provides a more flexible source of expander graphs. Its connectedness, the number of connected components, and diameter bound are studied via Weil's estimate for character sums. Furthermore, we study the algorithmic problem of computing the number of connected components and establish a link to the integer factorization problem. © 2014 Elsevier Inc.