Intriguing Sets of Vertices of Regular Graphs
- 127 Downloads
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.
KeywordsRegular graph Tight set Intriguing set Completely regular code T-Design
Mathematics Subject Classification (2000)05E30 15A42
Unable to display preview. Download preview PDF.
- 2.Bamberg, J., De Clerck, F., Durante, N.: Intriguing sets of partial quadrangles. Preprint, arXiv:0812.2871Google Scholar
- 3.Bamberg, J., Giudici, M., Royle, G.F.: Every flock generalised quadrangle has a hemisystem. Preprint, arXiv:0912.2574Google Scholar
- 9.Cossidente, A., Penttila, T.: A new hemisystem of H(3,49). Ars Combin. (to appear)Google Scholar
- 12.Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. No. 10, 97 pp. (1973)Google Scholar
- 13.Godsil C.: Algebraic Combinatorics. Chapman and Hall Mathematics Series. Chapman & Hall, New York (1993)Google Scholar
- 14.Godsil C., Royle G.: Algebraic graph theory. Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)Google Scholar
- 15.Haemers, W.H.: Eigenvalue techniques in design and graph theory. Ph.D. thesis, Technical University Eindhoven (1979)Google Scholar
- 18.Neumaier, A.: Regular sets and quasisymmetric 2-designs. Combinatorial theory (Schloss Rauischholzhausen, 1982), pp. 258–275. Lecture Notes in Mathematics, vol. 969, Springer, Berlin (1982)Google Scholar
- 22.Read R.C., Wilson R.J.: An atlas of graphs. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York (1998)Google Scholar