caa a22 4500 445855800 CHVBK 20180317145427.0 cr unu---uuuuu 170323e20110601xx s 000 0 eng 10.1007/s00026-011-0094-5 doi (NATIONALLICENCE)springer-10.1007/s00026-011-0094-5 Cores of Geometric Graphs [Elektronische Daten] [Chris Godsil, Gordon Royle] Cameron and Kazanidis have recently shown that rank-three graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of generalized quadrangles and that when the number of points is sufficiently large, it is also true for the block graphs of Steiner systems and orthogonal arrays. Springer Basel AG, 2011 graph homomorphism nationallicence core nationallicence strongly regular graph nationallicence partial geometry nationallicence Godsil Chris Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, Ontario, Canada aut Royle Gordon School of Mathematics and Statistics, University of Western Australia, 35 Stirling Highway Crawley, 6009, Perth, Western Australia, Australia aut Annals of Combinatorics SP Birkhäuser Verlag Basel 15/2(2011-06-01), 267-276 0218-0006 15:2<267 2011 15 26 https://doi.org/10.1007/s00026-011-0094-5 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00026-011-0094-5 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Godsil Chris Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, Ontario, Canada aut NATIONALLICENCE 700 1- Royle Gordon School of Mathematics and Statistics, University of Western Australia, 35 Stirling Highway Crawley, 6009, Perth, Western Australia, Australia aut NATIONALLICENCE 773 0- Annals of Combinatorics SP Birkhäuser Verlag Basel 15/2(2011-06-01), 267-276 0218-0006 15:2<267 2011 15 26 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer