Maistrelli, E and Penman, DB (2006) Some colouring problems for Paley graphs. Discrete Mathematics, 306 (1). pp. 99-106. DOI https://doi.org/10.1016/j.disc.2005.10.018
Maistrelli, E and Penman, DB (2006) Some colouring problems for Paley graphs. Discrete Mathematics, 306 (1). pp. 99-106. DOI https://doi.org/10.1016/j.disc.2005.10.018
Maistrelli, E and Penman, DB (2006) Some colouring problems for Paley graphs. Discrete Mathematics, 306 (1). pp. 99-106. DOI https://doi.org/10.1016/j.disc.2005.10.018
Abstract
The Paley graph Pq, where q≡1(mod4) is a prime power, is the graph with vertices the elements of the finite field Fq and an edge between x and y if and only if x-y is a non-zero square in Fq. This paper gives new results on some colouring problems for Paley graphs and related discussion. © 2005 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Paley graph; pseudo-random graph; graph colourings |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 18 Oct 2012 22:07 |
| Last Modified: | 04 Dec 2024 06:38 |
| URI: | http://repository.essex.ac.uk/id/eprint/4029 |
Available files
Filename: hmpaper.pdf