Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423730 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
We prove that if G and H are primitive strongly regular graphs with the same parameters and Ï is a homomorphism from G to H, then Ï is either an isomorphism or a coloring (homomorphism to a complete subgraph). Moreover, any such coloring is optimal for G and its image is a maximum clique of H. Therefore, the only endomorphisms of a primitive strongly regular graph are automorphisms or colorings. This confirms and strengthens a conjecture of Peter Cameron and Priscila Kazanidis that all strongly regular graphs are cores or have complete cores. The proof of the result is elementary, mainly relying on linear algebraic techniques.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David E. Roberson,