Algebraic Cayley Graphs over Finite Fields
classification
🧮 math.CO
keywords
graphsalgebraiccayleyfieldsfiniteboundcharacterchung
read the original abstract
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of Chung.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.