Abstract
Abstract The problem of finding a formula for the clique number of the Paley graph G*(p) where p is a prime number such that p ≡ 1(mod 4) seems to be a hard one. These clique numbers are known for the caws 5 ⋚ p ⋚ 1601. In this paper we show that the clique number and chromatic number of the Paley graph G*(p2r) are both pr, where p is an odd prime and r is a natural number. Upper and lower bounds for the clique numbers and chromatic numbers of some related graphs are also determined.
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.
