Mathematics – Combinatorics
Scientific paper
2008-06-07
Mathematics
Combinatorics
12 pages
Scientific paper
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.
Godsil Chris
Royle Gordon F.
No associations
LandOfFree
Cores of Geometric Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cores of Geometric Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cores of Geometric Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-65461