Cores of Geometric Graphs |
| |
| Authors: | Chris Godsil Gordon F. Royle |
| |
| Affiliation: | 1. Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada
2. School of Mathematics and Statistics, University of Western Australia, 35 Stirling Highway Crawley, Perth, 6009, Western Australia, Australia
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
