Cayley graphs generated by small degree polynomials over finite fields

2014/02/14 by Igor E. Shparlinski, Shparlinski, Igor E.
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.CO #math.NT

paper · pdf · doi:10.48550/arxiv.1402.3492

arxiv created 2014/02/14 · openalex publication_date 2014/02/14 · arxiv updated 2014/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.

Related

• Algebraic Cayley Graphs over Finite Fields
• Large Cayley graphs of small diameter
• New results for the degree/diameter problem
• Diameter of Cayley graphs of SL(n,p) with generating sets containing a transvection
• Diameters of Cayley graphs of SL_n(Z/kZ)