Intriguing Sets of Vertices of Regular Graphs

被引：0
作者：
Bart De Bruyn
Hiroshi Suzuki
机构：
[1] Ghent University,Department of Pure Mathematics and Computer Algebra
[2] International Christian University,Department of Mathematics and Computer Science
来源：
Graphs and Combinatorics | 2010年 / 26卷
关键词：
Regular graph; Tight set; Intriguing set; Completely regular code; -Design; 05E30; 15A42;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with these notions. Indeed, we show that some of the results obtained earlier can be generalized to larger classes of graphs. We also give some connections and relations with other notions and results from algebraic graph theory. One of the main tools in our study will be the Bose–Mesner algebra associated with the graph.
引用
收藏
页码：629 / 646
页数：17
相关论文
共 24 条
  • [1] Bamberg J.(2009)A hemisystem of a nonclassical generalised quadrangle Des. Codes Cryptogr. 51 157-165
  • [2] De Clerck F.(2007)Tight sets and J. Combin. Theory Ser. A 114 1293-1314
  • [3] Durante N.(2009)-ovoids of finite polar spaces Combinatorica 29 1-17
  • [4] Bamberg J.(2003)Tight sets and J. Combin. Theory Ser. A 102 255-271
  • [5] Kelly S.(2005)-ovoids of generalised quadrangles J. Lond. Math. Soc. (2) 72 731-741
  • [6] Law M.(2007)Width and dual width of subsets in polynomial association schemes Linear Algebra Appl. 424 480-491
  • [7] Penttila T.(2008)Hemisystems on the Hermitian surface Adv. Geom. 8 367-375
  • [8] Bamberg J.(1995)Tight sets of points in the half-spin geometry related to Linear Algebra Appl. 226/228 593-616
  • [9] Law M.(2003)(9, Discrete Math. 264 149-165
  • [10] Penttila T.(1992)) Discrete Math. 106/107 353-360
123