Cores of geometric graphs

From MaRDI portal
Publication:659623

DOI10.1007/S00026-011-0094-5zbMATH Open1234.05165arXiv0806.1300OpenAlexW2009700041MaRDI QIDQ659623FDOQ659623


Authors: Gordon Royle, Chris Godsil Edit this on Wikidata


Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0806.1300




Recommendations




Cites Work


Cited In (21)





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)