Abstract
We investigate BIBDs with three intersection numbers,x, y, and z, such that the relation on the block set given byA ∼ B iff the cardinality of the intersectionof A and B is not equal to x is an equivalence relation. Withsuch a design, we associate a family of strongly regular graphswith the same parameters. Two constructions producing infinitefamilies of such designs are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Beker and W. Haemers, 2-designs having an intersection k-n, J. Comb. Theory(A), Vol. 28 (1980) pp. 64–81.
T. Beth, D. Jungnickel and H. Lenz, Design Theory, Volumes I and II, Cambridge Univ. Press, UK (1999).
The CRC Handbook of Combinatorial Designs, (C. J. Colbourn and J. H. Dinitz, eds.) CRC Press (1996).
A. E. Brouwer, An infinite series of symmetric designs, Math. Centrum Amsterdam Report, ZW 136/80, (1983).
P. J. Cameron, Two remarks on Steiner systems, Geometriae Dedicata, Vol. 4 (1974) pp. 403–418.
J. D. Fanning, A family of symmetric designs, Discrete Mathematics, Vol. 146 (1995) pp. 307–312.
Y. J. Ionin, Symmetric subdesigns of symmetric designs, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 29 (1999) pp. 65–78.
Y. J. Ionin, A technique for constructing symmetric designs, Designs, Codes and Cryptography, Vol. 14 (1998) pp. 147–158.
Y. J. Ionin and M. S. Shrikhande, 5-designs with three intersection numbers, J. Comb. Theory(A), Vol. 69 (1995) pp. 36–50.
W. de Launey, On the non-existence of generalised weighing matrices, Ars Combinatoria, Vol. 17A (1984) pp. 117–132.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
K. N. Majumdar, On some theorems in combinatorics relating to incomplete block designs, Ann. Math. Statist., Vol. 24 (1953) pp. 379–384.
D. P. Rajkundlia, Some techniques for constructing infinite families of BIBDs, Discrete Mathematics, Vol. 44 (1983) pp. 61–96.
M. S. Shrikhande, Designs, intersection numbers, and codes, Coding Theory and Design Theory, IMA Vol. 21, (D. K. Ray-Chaudhuri, ed.) Springer (1990) pp. 304–318.
M. S. Shrikhande and S. S. Sane, Quasi-Symmetric Designs, London Mathematical Society Lecture Note Series, Vol. 164, Cambridge Univ. Press, Cambridge, UK, (1991).
S. S. Shrikhande and D. Raghavarao, A method of construction of incomplete block designs, Sankhya, Series A, Vol. 25 (1963) pp. 399–402.
S. S. Shrikhande and D. Raghavarao, Affine α-resolvable incomplete block designs, Contributions to Statistics, Pergamon Press, New York (1964) pp. 471–480.
N. M. Singhi and S. S. Shrikhande, Embedding of quasi-residual designs, Geometriae Dedicata, Vol. 2 (1974) pp. 509–517.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ionin, Y.J., Shrikhande, M. Strongly Regular Graphs and Designs with Three Intersection Numbers. Designs, Codes and Cryptography 21, 113–125 (2000). https://doi.org/10.1023/A:1008387611396
Issue Date:
DOI: https://doi.org/10.1023/A:1008387611396