Cores of geometric graphs

From MaRDI portal
Publication:659623




Abstract: Cameron and Kazanidis have recently shown that rank-3 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.









This page was built for publication: Cores of geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659623)