Abstract
Given a finite field, one can form a directed graph using the field elements as vertices and connecting two vertices if their difference lies in a fixed subgroup of the multiplicative group. If -1 is contained in this fixed subgroup, then we obtain an undirected graph that is referred to as a generalized Paley graph. In this paper, we study generalized Paley graphs whose clique and chromatic numbers coincide and link this theory to the study of the synchronization property in 1-dimensional primitive affine permutation groups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
