2013/03/14 by Mei Lu, Lu, Mei, Daqing Wan +7
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #math.CO
paper · pdf · doi:10.48550/arxiv.1303.3449
openalex publication_date 2013/03/14 · arxiv created 2013/04/06 · arxiv updated 2013/04/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.