Cores of Geometric Graphs
Cores of Geometric Graphs
复制标题
DOI：
10.1007/s00026-011-0094-5
复制
发表时间：
2008-06
影响因子：
0.5
通讯作者：
C. Godsil;G. Royle
中科院分区：
文献类型：
--
作者：
C. Godsil;G. Royle
卡梅隆和卡赞佩最近证明了秩3图要么是核，要么有完全核，他们问这是否对所有强正则图都成立。我们证明了这是真的广义四边形的点图和线图，当点数足够大时，它也是真实的斯坦纳系统和正交表的块图。
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.