Abel, R. J. R., Colbourn, C. J. & Dinitz, J. H., Mutually orthogonal Latin squares (MOLS) , pp. 160– 193 in: Handbook of Combinatorial Designs, 2nd ed., Colbourn, C. J. & Dinitz, J. H. (eds.), Chapman & Hall/CRC, Boca Raton, 2007. (p. 203)Google Scholar

Abel, R. J. R. & Greig, M., BIBDs with small block size , Chapter II.3, pp. 72–79 in: Handbook of Combinatorial Designs, 2nd ed., Colbourn, C. J. & Dinitz, J. H. (eds.), Chapman & Hall/CRC, Boca Raton, 2007. (p. 208)Google Scholar

Abiad, A. &Haemers, W. H., Switched symplectic graphs and their 2-ranks , Des. Codes Cryptogr. 81 (2016) 35–41. (pp. 235, 254)Google Scholar

Abramenko, P. & Brown, K. S., Buildings, Theory and Applications, GTM 248, Springer, New York, 2008. (p. 123)Google Scholar

Adm, M., Bergen, R., Ihringer, F., Jaques, S., Meagher, K., Purdy, A. & Yang, B., Ovoids of generalized quadrangles of order (q, q ² − q) and Delsarte cocliques in related strongly regular graphs , J. Combin. Designs 26 (2018) 249–263. (p. 214)CrossRefGoogle Scholar

Ahrens, R. W. & Szekeres, G., On a combinatorial generalization of27 lines associated with a cubic surface , J. Austral. Math. Soc. 10 (1969) 485–492. (p. 111)Google Scholar

Al-Azemi, A., Betten, A. & Betten, D., Unital designs with blocking sets , Discr. Appl. Math. 163 (2014) 102–112. (p. 294)Google Scholar

Alfuraidan, M. R., Sarumi, I. O. & Shpectorov, S., On the non-existence of srg(76, 21, 2, 7) , Graphs Combin. 35 (2019) 847–854. (p. 16)Google Scholar

Amarra, C., Jin, Wei & Praeger, C. E., On locally n × n grid graphs, arXiv:1903.07931, Mar. 2019. (p. 150)Google Scholar

В. Л. Арлазаров, А. А. Леман & М. З. Розенфельд (V. L. Arlazarov, A. A. Lehman & M. Z. Rozenfel’d), Построение и исследование на ЭВМ графов с 25, 26 и 29 вершинами (The construction and analysis by a computer of the graphs on 25, 26 and 29 vertices) (Russian), preprint, 58 pp., Institute of Control Theory, Moscow (1975). (p. 274)Google Scholar

Arslan, O. & Sin, P., Some simple modules for classical groups and p-ranks of orthogonal and Hermitian geometries , J. Algebra 327 (2011) 141–169. (pp. 67)Google Scholar

Aschbacher, M., On collineation groups of symmetric block designs , J. Combin. Th. 11 (1971) 272–281. (p. 208)Google Scholar

Aschbacher, M., 3-Transposition Groups, Cambridge Univ. Press, Cambridge, 1997. (p. 146)Google Scholar

Aschbacher, M., Flag structures on Tits geometries , Geom. Dedicata 14 (1983) 21–32. (p. 359)CrossRefGoogle Scholar

Aschbacher, M., The 27-dimensional module for E ₆,I , Invent. Math. 89 (1987) 159–195. (p. 134)Google Scholar

Aschbacher, M. & Smith, S., Tits geometries over GF(2) defined by groups over GF(3) , Comm. Algebra 11 (1983) 1675–1684. (p. 126)CrossRefGoogle Scholar

jr.Assmus, E. F. & Key, J. D., Designs and their Codes, Cambridge Univ. Press, Cambridge, 1992. (p. 249)Google Scholar

jr.Assmus, E. F. & jr.Mattson, H. F., New 5-designs , J. Combin. Th. 6 (1969) 122–151. (p. 364)Google Scholar

jr.Assmus, E. F., Mezzaroba, J. A. & Salwach, C. J., Planes and biplanes , pp. 205–212 in: Higher Combinatorics, Proc. NATO Advanced Study Inst. (Berlin 1976), Reidel, Dordrecht, 1977. (p. 208)Google Scholar

Azarija, J. & Marc, T., There is no (75,32,10,16) strongly regular graph , Lin. Alg. Appl. 557 (2018) 62–83. (pp. 16, 210, 230, 401)Google Scholar

Azarija, J. & Marc, T., There is no (95,40,12,20) strongly regular graph , J. Combin. Designs 28 (2020) 294–306. (pp. 16, 210, 211, 230, 402)CrossRefGoogle Scholar

Babai, L., On the complexity of canonical labeling of strongly regular graphs , SIAM J. Comput. 9 (1980) 212–216. (p. 241)Google Scholar

Babai, L., On the automorphism groups of strongly regular graphs I , pp. 359–368 in: Proc. Conf. Innovations Theor. Comp. Sci. (Princeton, 2014), ACM, 2014. (p. 241)Google Scholar

Babai, L., On the automorphism groups of strongly regular graphs II , J. Algebra 421 (2015) 560–578. (p. 241)Google Scholar

Babai, L., Graph isomorphism in quasipolynomial time, arXiv:1512.03547, Jan. 2016. (p. 241)CrossRefGoogle Scholar

Babai, L., Graph isomorphism in quasipolynomial time (extended abstract), pp. 684–697 in: STOC’16—Proc. 48th ACMSIGACT Symp. Theor. Computing (Cambridge, MA, 2016), Wichs, D. & Mansour, Y. (eds.), ACM, New York, 2016. (p. 241)Google Scholar

Babai, L., Grigoryev, D. Yu. & Mount, D. M., Isomorphism of graphs with bounded eigenvalue multiplicity , pp. 310–324 in: Proc. 14th ACM Symp. Theor. Computing (San Francisco, 1982), ACM, New York, 1982. (p. 241)Google Scholar

Babai, L. & Wilmes, J., Asymptotic Delsarte cliques in distance-regular graphs , J. Alg. Combin. 43 (2016) 771–782. (p. 243)CrossRefGoogle Scholar

Bagchi, B., A regular two-graph admitting the Hall-Janko-Wales group, pp. 35–45 in: Combinatorial Mathematics and Applications (Calcutta, 1988), Sankhyā (Ser. A) 54 (1992), Special Issue. (pp. 307, 308)Google Scholar

Bagchi, B., On quasi-symmetric designs , Des. Codes Cryptogr. 2 (1992) 69–79. (pp. 211, 213)Google Scholar

Bagchi, B., On strongly regular graphs with μ ≤ 2 , Discr. Math. 306 (2006) 1502–1504. (p. 243)Google Scholar

Bagchi, S. & Bagchi, B., Designs from pairs of finite fields I. A cyclic unital U (6) and other regular Steiner 2-designs , J. Combin. Th. (A) 52 (1989) 51–61. (p. 91)Google Scholar

Bagchi, B., Brouwer, A. E. & Wilbrink, H. A., Notes on binary codes related to the O(5,q) generalized quadrangle for odd q , Geom. Dedicata 39 (1991) 339–355. (pp. 255)CrossRefGoogle Scholar

Baker, R. D., Partitioning the planes of AO2^m (2) into 2-designs, Discr. Math. 15 (1976) 205–211. (p. 111)Google Scholar

Ball, S., Blokhuis, A. & Mazzocca, F., Maximal arcs in Desarguesian planes of odd order do not exist , Combinatorica 17 (1997) 31–41. (p. 179)Google Scholar

Ball, S., Govaerts, P. & Storme, L., On ovoids of parabolic quadrics , Des. Codes Cryptogr. 38 (2006) 131–145. (pp. 69, 70)Google Scholar

Balonin, N. A. & Seberry, J., A review and new symmetric conference matrices , Информационно-управляющие системы 71 (2014) 2–7. (p. 200)Google Scholar

Bamberg, J., De Beule, J. & Ihringer, F., New non-existence proofs for ovoids of Hermitian polar spaces and hyperbolic quadrics, Ann. Comb. 21 (2017) 25–42. (p. 74)Google Scholar

Bamberg, J. & De Clerck, F., A geometric construction of Mathon’s perp-system from four lines of _PG(5, 3) , J. Combin. Designs 18 (2010) 450–461. (p. 217)CrossRefGoogle Scholar

Bamberg, J., Giudici, M. & Royle, G. F., Every flock generalized quadrangle has a hemisystem , Bull. London Math. Soc. 42 (2010) 795–810. (p. 224)Google Scholar

Bamberg, J., Giudici, M. & Royle, G. F., Hemisystems of small flock generalized quadrangles , Des. Codes Cryptogr. 67 (2013) 137–157. (p. 224)Google Scholar

Bamberg, J., Kelly, S., Law, M. & Penttila, T., Tight sets and m-ovoids of finite polar spaces , J. Combin. Th. (A) 114 (2007) 1293–1314. (pp. 42, 61, 72, 75, 76, 282)Google Scholar

Bamberg, J., Law, M. & Penttila, T., Tight sets and m-ovoids of generalised quadrangles , Combinatorica 29 (2009) 1–17. (pp. 61, 62, 282)Google Scholar

Bamberg, J., Lee, M., Momihara, K. & Xiang, Q., A new infinite family of hemisystems of the Hermitian surface , Combinatorica 38 (2018) 43–66. (pp. 187, 224)Google Scholar

Bannai, E., Maximal subgroups of low rank of finite symmetric and alternating groups , J. Fac. Sci. Univ. Tokyo Sect. IA Math. 18 (1971/72) 475–486. (pp. 382, 384)Google Scholar

Bannai, Eiichi & Bannai, Etsuko, A survey on spherical designs and algebraic combinatorics on spheres , Europ. J. Combin. 30 (2009) 1392–1425. (pp. 237, 239)CrossRefGoogle Scholar

Bannai, E. & Damerell, R. M., Tight spherical designs, I , J. Math. Soc. Japan 31 (1979) 199–207. (p. 238)Google Scholar

Bannai, E. & Damerell, R. M., Tight spherical designs, II , J. London Math. Soc. (2) 21 (1980) 13–30. (p. 238)Google Scholar

Bannai, E., Munemasa, A. &Venkov, B., The nonexistence of certain tight spherical designs , Алгебра и анализ (Algebra i Analiz) 16 (2004) 1–23. English translation: St. Petersburg Math. J. 16 (2005) 609–625. (pp. 17, 238)Google Scholar

Bannai, E. & Sloane, N. J. A., Uniqueness of certain spherical codes , Canad. J. Math. 33 (1981) 437–449. (p. 238)Google Scholar

Barwick, S. G. & Ebert, G. L., Unitals in Projective Planes, Springer, New York, 2008. (p. 91)Google Scholar

Barwick, S. G., Jackson, Wen-Ai & Penttila, T., New families of strongly regular graphs , Australas. J. Combin. 67 (2017) 486–507. (p. 235)Google Scholar

Batten, L. & Dover, J. M., Some sets of type (m, n) in cubic order planes , Des. Codes Cryptogr. 16 (1999) 211–213. (pp. 175, 183)Google Scholar

Baumert, L. D., Mills, W. H. & Ward, R. L., Uniform cyclotomy , J. Number Th. 14 (1982) 67–82. (p. 186)Google Scholar

Behbahani, M. &Lam, C., Strongly regular graphs with non-trivial automorphisms , Discr. Math. 311 (2011) 132–144. (pp. 17, 400)Google Scholar

Behbahani, M., Lam, C. & , P. R. J. Östergård, On triple systems and strongly regular graphs , J. Combin. Th. (A) 119 (2012) 1414–1426. (p. 218)Google Scholar

Belevitch, V., Conference networks and Hadamard matrices , Ann. Soc. Sci. Bruxelles Sér. I 82 (1968) 13–32. (p. 200)Google Scholar

Benson, C. T. & Losey, N. E., On a graph of Hoffman and Singleton , J. Combin. Th. 11 (1971) 67–79. (p. 287)Google Scholar

Berlekamp, E. R., van Lint, J. H. & Seidel, J. J., A strongly regular graph derived from the perfect ternary Golay code , pp. 25–30 in: A Survey of Combinatorial Theory, Symp. Colorado State Univ., 1971, Srivastava, J. N. et al. (eds.), North Holland, Amsterdam, 1973. (p. 333)Google Scholar

Bernasconi, A. & Codenotti, B., Spectral analysis of Boolean functions as a graph eigenvalue problem , IEEE Trans. Computers 48 (1999) 345–351. (p. 196)CrossRefGoogle Scholar

Bernasconi, A., Codenotti, B. & VanderKam, J. M., A characterization of bent functions in terms of strongly regular graphs , IEEE Trans. Computers 50 (2001) 984–985. (p. 196)Google Scholar

Berndt, B. C., Evans, R. J. & Williams, K. S., Gauss and Jacobi Sums, Wiley, New York etc., 1998. (p. 187)Google Scholar

Beukemann, L. & Metsch, K., Small tight sets of hyperbolic quadrics , Des. Codes Cryptogr. 68 (2013) 11–24. (p. 76)Google Scholar

Beukers, F., On the generalized Ramanujan-Nagell equation I , Acta Arith. 38 (1981) 389–410. (p. 180)Google Scholar

Beutelspacher, A., On parallelisms in finite projective spaces , Geom. Dedicata 3 (1974) 35–40. (p. 111)Google Scholar

Beutelspacher, A., Partial spreads in finite projective spaces and partial designs , Math. Z. 145 (1975) 211–229. (p. 111)Google Scholar

Biggs, N., Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1974. (p. 18)Google Scholar

Bishnoi, A. & De Bruyn, B., Characterizations of the Suzuki tower near polygons , Des. Codes Cryptogr. 84 (2017) 115–133. (p. 347)Google Scholar

Blass, A., Exoo, G. & Harary, F., Paley graphs satisfy all first-order adjacency axioms , J. Graph Theory 5 (1981) 435–439. (p. 193)Google Scholar

van der Blij, F. & Springer, T. A., Octaves and triality , Nieuw Arch. Wisk. 8 (1960) 158–169. (p. 132)Google Scholar

Bloemen, I., Thas, J. A. & Van Maldeghem, H., Translation ovoids of generalized quadrangles and hexagons , Geom. Dedicata 72 (1998) 19–62. (p. 76)Google Scholar

Blokhuis, A., On subsets of GF(q²) with square differences , Indag. Math. 46 (1984) 369–372. (p. 192)Google Scholar

Blokhuis, A. & Brouwer, A. E., Uniqueness of a Zara graph on 126 points and non-existence of a completely regular two-graph on 288 points, pp. 6–19 in: Papers dedicated to Seidel, J. J., de Doelder, P. J., de Graaf, J. & van Lint, J. H. (eds.), Eindhoven Univ. of Technology Report 84-WSK-03, Aug. 1984. (pp. 226, 231)Google Scholar

Blokhuis, A. & Brouwer, A. E., Locally 4-by-4 grid graphs , J. Graph Theory 13 (1989) 229–244. (pp. 150, 231)Google Scholar

Blokhuis, A. & Brouwer, A. E., Locally K_3,3 or Petersen graphs , Discr. Math. 106 /107 (1992) 53–60. (p. 148)Google Scholar

Blokhuis, A. & Brouwer, A. E., Determination of the distance-regular graphs without 3-claws , Discr. Math. 163 (1997) 225–227. (p. 273)Google Scholar

Blokhuis, A., Brouwer, A. E., Buset, D. & Cohen, A. M., The locally icosahedral graphs, pp. 19–22 in: Finite Geometries (Conf. Winnipeg 1984), Marcel Dekker, New York, 1985. (p. 260)Google Scholar

Blokhuis, A. & Calderbank, A. R., Quasi-symmetric designs and the Smith normal form , Des. Codes Cryptogr. 2 (1992) 189–206. (pp. 211, 213)Google Scholar

Blokhuis, A., Brouwer, A. E. & Haemers, W. H., The graph with spectrum 14¹ 2⁴⁰ (−4)¹⁰ (−6)⁹ , Des. Codes Cryptogr. 65 (2012) 71–75. (p. 300)Google Scholar

Blokhuis, A. & Haemers, W. H., An infinite family of quasi-symmetric designs , J. Stat. Plann. Infer. 95 (2001) 117–119. (p. 211)Google Scholar

Blokhuis, A., Kloks, T. & Wilbrink, H., A class of graphs containing the polar spaces , Europ. J. Combin. 7 (1986) 105–114. (pp. 225)CrossRefGoogle Scholar

Blokhuis, A. & Moorhouse, G. E., Some p-ranks related to orthogonal spaces , J. Alg. Combin. 4 (1995) 295–316. (pp. 67, 81)Google Scholar

Blokhuis, A. & Wilbrink, H., Characterization theorems for Zara graphs , Europ. J. Combin. 10 (1989) 57–68. (pp. 226, 231)Google Scholar

Bollob, B.ás & Thomason, A., Graphs which contain all small graphs , Europ. J. Combin. 2 (1981) 13–15. (p. 193)Google Scholar

van Bon, J., On locally Hoffman-Singleton graphs , J. Combin. Th. (B) 63 (1995) 159–161. (p. 289)Google Scholar

van Bon, J., Finite primitive distance-transitive graphs , Europ. J. Combin. 28 (2007) 517–532. (p. 19)Google Scholar

Bondarenko, A. V., On Borsuk’s conjecture for two-distance sets , Discr. Comput. Geom. 51 (2014) 509–515. (p. 348)Google Scholar

Bondarenko, A. V., Mellit, A., Prymak, A., Radchenko, D. & Viazovska, M., There is no strongly regular graph with parameters (460,153,32,60), pp. 131–134 in: Contemporary Computational Mathematics—A Celebration of the 80th Birthday of Ian Sloan, Springer, Cham, 2018. (Also arXiv:1509.06286, Sep. 2015.) (pp. 17, 26, 239, 421)Google Scholar

Bondarenko, A. V., Prymak, A. & Radchenko, D., Non-existence of (76,30,8,14) strongly regular graph and some structural tools , Lin. Alg. Appl. 527 (2017) 53–72. (pp. 16, 210, 239, 401)Google Scholar

Bondarenko, A. V. & Radchenko, D. V., On a family of strongly regular graphs with λ = 1 , J. Combin. Th. (B) 103 (2013) 521–531. (pp. 17, 354, 411)Google Scholar

Borsuk, K., Drei Sätze über die n-dimensionale euklidische Sphäre , Fund. Math. 20 (1933) 177–190. (p. 348)Google Scholar

Bose, R. C., Strongly regular graphs, partial geometries and partially balanced designs , Pacif. J. Math. 13 (1963) 389–419. (pp. 1, 2, 216, 218, 219)Google Scholar

Bose, R. C. & Dowling, T. A., A generalization of Moore graphs of diameter two , J. Combin. Th. 11 (1971) 213–226. (pp. 227, 245)Google Scholar

Bose, R. C. & Laskar, R., A characterization of tetrahedral graphs , J. Combin. Th. 3 (1967) 366–385. (p. 219)Google Scholar

Bose, R. C. & Mesner, D. M., On linear associative algebras corresponding to association schemes of partially balanced designs , Ann. Math. Statist. 30 (1959) 21–38. (p. 22)Google Scholar

Bose, R. C. & Nair, K. R., Partially balanced incomplete block designs , Sankhyā 4 (1939) 337–372. (p. 22)Google Scholar

Bose, R. C. & Shimamoto, T., Classification and analysis of partially balanced incomplete block designs with two associate classes , J. Amer. Stat. Assoc. 47 (1952) 151–184. (pp. 1, 22, 31)Google Scholar

Bose, R. C. & Shrikhande, S. S., On the falsity of Euler’s conjecture about the nonexistence of two orthogonal Latin squares of order 4t +2 , Proc. Nat. Acad. Sci. U.S.A. 45 (1959) 734–737. (p. 203)Google Scholar

Bose, R. C. & Shrikhande, S. S., Graphs in which each pair of vertices is adjacent to the same number d of other vertices , Studia Sci. Math. Hungar. 5 (1970) 181–195. (p. 199)Google Scholar

Bose, R. C. & Shrikhande, S. S., Some further constructions for G₂ (d) graphs , Studia Sci. Math. Hungar. 6 (1971) 127–132. (p. 198)Google Scholar

Bose, R. C., Shrikhande, S. S. & Parker, E. T., Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler’s conjecture , Canad. J. Math. 12 (1960) 189–203. (p. 203)Google Scholar

Bourbaki, N., Groupes et algèbres de Lie, Chap. 4, 5 et 6, Masson, Paris, 1981. (p. 119)Google Scholar

Bouyukliev, I., Fack, V., Willems, W. & Winne, J., Projective two-weight codes with small parameters and their corresponding graphs , Des. Codes Cryptogr. 41 (2006) 59–78. (pp. 177, 180, 183, 301)Google Scholar

Bouyukliev, I. & Simonis, J., Some new results on optimal codes over 𝔽₅, Des. Codes Cryptogr. 30 (2003) 97–111. (p. 181)Google Scholar

Bracken, C., McGuire, G. & Ward, H., New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices , Des. Codes Cryptogr. 41 (2006) 195–198. (pp. 211)Google Scholar

Bremner, A. & Morton, P., The integer points on three related elliptic curves , Math. Comp. 39 (1982) 235–238. (p. 180)Google Scholar

Bremner, A., Calderbank, R., Hanlon, P., Morton, P. & Wolfskill, J., Two-weight ternary codes and the equation y² = 4 × 3^a + 13 , J. Number Th. 16 (1983) 212–234. (p. 180)Google Scholar

Bridges, W. G. & Mena, R. A., Rational circulants with rational spectra and cyclic strongly regular graphs , Ars. Combin. 8 (1979) 143–161. (p. 192)Google Scholar

Bridges, W. G. & Mena, R. A., Rational O-matrices with rational eigenvalues , J. Combin. Th. (A) 32 (1982) 264–280. (p. 192)Google Scholar

Brouwer, A. E., Polarities of G. Higman’s symmetric design and a strongly regular graph on 176 vertices , Aequationes Math. 25 (1982) 77–82. (p. 330)Google Scholar

Brouwer, A. E., The uniqueness of the strongly regular graph on 77 points , J. Graph Theory 7 (1983) 455–461. (pp. 16, 298, 401)Google Scholar

Brouwer, A. E., Some new two-weight codes and strongly regular graphs , Discr. Appl. Math. 10 (1985) 111–114. (pp. 175, 179, 182, 401, 410)Google Scholar

Brouwer, A. E., Uniqueness and nonexistence of some graphs related to M₂₂ , Graphs Combin. 2 (1986) 21–29. (p. 332)Google Scholar

Brouwer, A. E., The complement of a geometric hyperplane in a generalized polygon is usually connected , pp. 53–57 in: Finite Geometry and Combinatorics, Proc. Deinze 1992, De Clerck, F. et al. (eds.), LMS Lecture Note Ser. 191, Cambridge Univ. Press, 1993. (p. 115)Google Scholar

Brouwer, A. E., On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M₁₂) , Discr. Math. 126 (1994) 13–27. (p. 326)Google Scholar

Brouwer, A. E., Block designs , pp. 693–745 in: Handbook of Combinatorics, Graham, R., Groetschel, M., Lovász, L. (eds.), Elsevier, Amsterdam, 1995. (p. 164)Google Scholar

Brouwer, A. E., Variations on a theme by Weetman , Discr. Math. 138 (1995) 137–145. (p. 245)Google Scholar

Brouwer, A. E., Toughness and spectrum of a graph , Lin. Alg. Appl. 226 –228 (1995) 267–271. (p. 242)CrossRefGoogle Scholar

Brouwer, A. E., Locally Paley graphs , Des. Codes Cryptogr. 21 (2000) 69–76. (p. 193)Google Scholar

Brouwer, A. E., Paulus graphs, http://www.win.tue.nl/~aeb/drg/graphs/Paulus.html. (p. 269)Google Scholar

Brouwer, A. E. & Calderbank, A. R., An Erdős-Ko-Rado theorem for regular intersecting families of octads , Graphs Combin. 2 (1986) 309–316. (p. 210)Google Scholar

Brouwer, A. E., Cohen, A. M., Hall, J. I. & Wilbrink, H. A., Near polygons and Fischer spaces , Geom. Dedicata 49 (1994) 349–368. (pp. 166, 359)Google Scholar

Brouwer, A. E., Cohen, A. M. & Neumaier, A., Distance-Regular Graphs, Springer, 1989. (pp. 3, 6, 7, 19, 21, 25, 29, 42, 84, 90, 98, 107, 108, 109, 115, 150, 175, 193, 227, 232, 233, 288, 289, 319, 323, 327, 347, 371)Google Scholar

Brouwer, A. E. & Cohen, A. M. (with an appendix by Tits, J.), Some remarks on Tits geometries , Indag. Math. 45 (1983) 393–402 = Proc. KNAW A 86 (1983) 393–402. (p. 126)Google Scholar

Brouwer, A. E., Ducey, J. E. & Sin, P., The elementary divisors of the incidence matrix of skew lines in PG(3, q) , Proc. Amer. Math. Soc. 140 (2012) 2561–2573. (p. 259)Google Scholar

Brouwer, A. E. & van Eijl, C. A., On the p-rank of the adjacency matrices of strongly regular graphs , J. Alg. Combin. 1 (1992) 329–346. (pp. 250, 251, 252, 254, 257, 258, 265, 273)Google Scholar

Brouwer, A. E. &van Eupen, M., The correspondence between projective codes and 2-weight codes , Des. Codes Cryptogr. 11 (1997) 261–266. (p. 175)Google Scholar

Brouwer, A. E., Fon-der-Flaass, D. G. & Shpectorov, S. V., Locally co-Heawood graphs , pp. 59–68 in: Finite Geometry and Combinatorics—Proc. Deinze 1992, De Clerck, F. et al. (eds.), LMS Lecture Note Ser. 191, Cambridge Univ. Press, 1993. (p. 277)Google Scholar

Brouwer, A. E. & Güven, Ç., The generating rank of the space of short vectors in the Leech lattice mod 2 , Des. Codes Cryptogr. 65 (2012) 107–113. (p. 173)Google Scholar

Brouwer, A. E. & Haemers, W. H., Structure and uniqueness of the (81,20,1,6) strongly regular graph , Discr. Math. 106 /107 (1992) 77–82. (pp. 16, 299)Google Scholar

Brouwer, A. E. & Haemers, W. H., The Gewirtz graph—an exercise in the theory of graph spectra , Europ. J. Combin. 14 (1993) 397–407. (p. 290)Google Scholar

Brouwer, A. E. & Haemers, W. H., Spectra of Graphs, Springer, New York etc., 2012. (pp. 7, 9, 11, 15, 21, 29, 214, 231, 235, 236, 239, 241, 243, 250, 256, 262, 273, 285)Google Scholar

Brouwer, A. E., Horiguchi, N., Kitazume, M. & Nakasora, H., A construction of the sporadic Suzuki graph from U₃(4) , J. Combin. Th. (A) 116 (2009) 1056–1062. (pp. 360, 361)Google Scholar

Brouwer, A. E., Ivanov, A. V. & Klin, M. H., Some new strongly regular graphs , Combinatorica 9 (1989) 339–344. (pp. 178, 240)Google Scholar

Brouwer, A. E., Koolen, J. H. &Klin, M. H., A root graph that is locally the line graph of the Petersen graph , Discr. Math. 264 (2003) 13–24. (pp. 402)Google Scholar

Brouwer, A. E., Koolen, J. H. & Riebeek, R. J., A new distance-regular graph associated to the Mathieu group M₁₀ , J. Alg. Combin. 8 (1998) 153–156. (p. 333)Google Scholar

Brouwer, A. E. & van Lint, J. H., Strongly regular graphs and partial geometries, pp. 85–122 in: Enumeration and Design (Waterloo, Ont., 1982), Academic Press, Toronto, 1984. (pp. 87, 89, 198, 199, 323)Google Scholar

Brouwer, A. E. & Mesner, D. M., The connectivity of strongly regular graphs , Europ. J. Combin. 6 (1985) 215–216. (p. 14)Google Scholar

Brouwer, A. E. & Neumaier, A., A remark on partial linear spaces of girth 5 with an application to strongly regular graphs , Combinatorica 8 (1988) 57–61. (p. 243)Google Scholar

Brouwer, A. E. & Pasechnik, D. V., Two distance-regular graphs , J. Alg. Combin. 36 (2012) 403–407. (p. 97)Google Scholar

Brouwer, A. E. & Polak, S. C., Uniqueness of codes using semidefinite programming , Des. Codes Cryptogr. 87 (2019) 1881–1895. (pp. 160, 164)Google Scholar

Brouwer, A. E. & Shult, E. E., Graphs with odd cocliques , Europ. J. Combin. 11 (1990) 99–104. (pp. 112, 148, 280)Google Scholar

Brouwer, A. E. & Wilbrink, H. A., The structure of near polygons with quads , Geom. Dedicata 14 (1983) 145–176. (p. 166)Google Scholar

Brouwer, A. E. & Wilbrink, H. A., Ovoids and fans in the generalized quadrangle GQ(4, 2) , Geom. Dedicata 36 (1990) 121–124. (pp. 81, 138, 272)Google Scholar

Brouwer, A. E. &Wilbrink, H. A., Block Designs , pp. 349–382 in: Handbook of Incidence Geometry, Buekenhout, F. (ed.), North-Holland, Amsterdam, 1995. (p. 249)Google Scholar

Brouwer, A. E., Wilson, R. M. & Xiang, Qing, Cyclotomy and strongly regular graphs , J. Alg. Combin. 10 (1999) 25–28. (p. 186)Google Scholar

Brown, K. S., Buildings, Springer, New York, 1989. (p. 123)Google Scholar

Bruck, R. H., Finite Nets II. Uniqueness and Inbedding , Pacif. J. Math. 13 (1963) 421–457. (pp. 218, 219)Google Scholar

Bruck, R. H., A survey of Binary Systems, Springer, Heidelberg, 1968 (p. 147)Google Scholar

Bruck, R. H. & Ryser, H. J., The nonexistence of certain finite projective planes , Canad. J. Math. 1 (1949) 88–93. (p. 201)Google Scholar

Bruen, A. A. & Drudge, K., The construction of Cameron-Liebler line classes in PG(3,q) , Finite Fields Appl. 5 (1999) 35–45. (p. 77)Google Scholar

Bruen, A. A. & Hirschfeld, J. W. P., Intersections in projective space. II. Pencils of quadrics , Europ. J. Combin. 9 (1988) 255–270. (p. 302)Google Scholar

Buczak, J. M. J., Finite group theory, Ph. D. Thesis, Oxford, 1980. (p. 240)Google Scholar

Buekenhout, F., La géométrie des groupes de Fischer, unpublished, 1974. (p. 141)Google Scholar

Buekenhout, F., Diagrams for geometries and groups , J. Combin. Th. (A) 27 (1979) 121–151. (p. 117)Google Scholar

Buekenhout, F. & Hubaut, X., Locally polar spaces and related rank 3 groups , J. Algebra 45 (1977) 391–434. (pp. 150, 272, 280)Google Scholar

Buekenhout, F. & Lef, C.èvre, Generalized quadrangles in projective spaces , Arch. Math. (Basel) 25 (1974) 540–552. (p. 46)Google Scholar

Buekenhout, F. & Shult, E., On the foundations of polar geometry , Geom. Dedicata 3 (1974) 155–170. (p. 33)Google Scholar

Buekenhout, F. & Van Maldeghem, H., A characterization of some rank 2 incidence geometries by their automorphism group , Mitt. Math. Sem. Giessen 218 (1994), i+70 pp. (p. 389)Google Scholar

Buset, D., Quelques conditions locales et extrémales en théorie des graphes, Ph. D. Thesis, Université Libre de Bruxelles, December 1997. (p. 193)Google Scholar

Bussemaker, F. C., Mathon, R. A. & Seidel, J. J., Tables of two-graphs , Technische Hogeschool Eindhoven, report 79-WSK-05, Eindhoven, Oct. 1979, 101 pp. (pp. 230, 274)Google Scholar

Bussemaker, F. C., Haemers, W. H., Mathon, R. & Wilbrink, H. A., A (49, 16, 3, 6) strongly regular graph does not exist , Europ. J. Combin. 10 (1989) 413–418. (pp. 16, 400)Google Scholar

Bussemaker, F. C., Haemers, W. H. & Spence, E., The search for pseudo orthogonal Latin squares of order six , Des. Codes Cryptogr. 21 (2000) 77–82. (p. 244)Google Scholar

Calderbank, A. R., On uniformly packed [n, n − k,4] codes over GF(q) and a class of caps in PG(k − 1,q) , J. London Math. Soc. 26 (1982) 365–385. (p. 180)Google Scholar

Calderbank, A. R., The application of invariant theory to the existence of quasi-symmetric designs , J. Combin. Th. (A) 44 (1987) 94–109. (pp. 210, 211, 212, 213)CrossRefGoogle Scholar

Calderbank, A. R., Geometric invariants for quasi-symmetric designs , J. Combin. Th. (A) 47 (1988) 101–110. (pp. 210, 211, 212, 213)Google Scholar

Calderbank, A. R., Inequalities for quasi-symmetric designs , J. Combin. Th. (A) 48 (1988) 53–64. (pp. 206, 207)Google Scholar

Calderbank, A. R. & Frankl, P., Binary codes and quasi-symmetric designs , Discr. Math. 83 (1990) 201–204. (pp. 211, 213)Google Scholar

Calderbank, A. R. & Kantor, W. M., The geometry of two-weight codes , Bull. London Math. Soc. 18 (1986) 97–122. (pp. 175, 354)Google Scholar

Cameron, P. J., On groups with several doubly-transitive permutation representations , Math. Z. 128 (1972) 1–14. (p. 244)Google Scholar

Cameron, P. J., Partial quadrangles , Quart. J. Math. Oxford (2) 26 (1975) 61–73. (p. 222)Google Scholar

Cameron, P. J., 6-Transitive graphs , J. Combin. Th. (B) 28 (1980) 168–179. (p. 240)Google Scholar

Cameron, P. J., Finite permutation groups and finite simple groups , Bull. London Math. Soc. 13 (1981) 1–22. (p. 383)Google Scholar

Cameron, P. J., Dual polar spaces , Geom. Dedicata 12 (1982) 75–85. (p. 166)Google Scholar

Cameron, P. J., Covers of graphs and EGQs , Discr. Math. 97 (1991) 83–92. (p. 150)Google Scholar

Cameron, P. J., Random strongly regular graphs , Discr. Math. 273 (2003) 103–114. (p. 17)Google Scholar

Cameron, P. J., Delsarte, P. & Goethals, J.-M., Hemisystems, orthogonal configurations, and dissipative conference matrices , Philips J. Res. 34 (1979) 147–162. (p. 83)Google Scholar

Cameron, P. J., Goethals, J. M. & Seidel, J. J., Strongly regular graphs having strongly regular subconstituents , J. Algebra 55 (1978) 257–280. (pp. 15, 16, 26, 27, 216, 310, 328, 332, 403, 405)Google Scholar

Cameron, P. J., Goethals, J.-M., Seidel, J. J. & Shult, E. E., Line graphs, root systems, and elliptic geometry , J. Algebra 43 (1976) 305–327. (p. 7)Google Scholar

Cameron, P. J. & Liebler, R. A., Tactical decompositions and orbits of projective groups , Lin. Alg. Appl. 46 (1982) 91–102. (p. 77)Google Scholar

Cameron, P. J. & van Lint, J. H., On the partial geometry pg(6, 6, 2) , J. Combin. Th. (A) 32 (1982) 252–255. (pp. 217, 301)Google Scholar

Cameron, P. J. & van Lint, J. H., Designs, Graphs, Codes and their Links, London Math. Soc. Student texts 22, Cambridge Univ. Press, 1991. (pp. 207, 240)Google Scholar

Cameron, P. J. & Rudvalis, A., A design and a geometry for the group Fi₂₂ , Des. Codes Cryptogr. 44 (2007) 11–14. (p. 376)Google Scholar

Cameron, P. J. & Stark, D., A prolific construction of strongly regular graphs with the n-e.c. property , Electr. J. Combin. 9 (2002) #R31. (p. 17)Google Scholar

Cardinali, I. & De Bruyn, B., Spin-embeddings, two-intersection sets and two-weight codes , Ars. Combin. 109 (2013) 309–319. (p. 76)Google Scholar

Carlitz, L., A theorem on permutations in a finite field , Proc. Amer. Math. Soc. 11 (1960) 456–459. (pp. 5, 192)Google Scholar

Carmichael, R. D., Tactical configurations of rank two , Amer. J. Math. 53 (1931) 217–240. (p. 161)Google Scholar

Cayley, A., On the triple tangent planes of surfaces of the third order , Cambridge and Dublin Math. J. 4 (1849) 118–132. (p. 271)Google Scholar

Chakravarti, I. M., Some properties and applications of Hermitian varieties in a finite projective space _PG(N,q²) in the construction of strongly regular graphs (two-class association schemes) and block designs , J. Combin. Th. 11 (1971) 268–283. (p. 91)Google Scholar

Chandler, D. B., Sin, P. & Xiang, Q., The Smith and critical groups of Paley graphs , J. Alg. Combin. 41 (2015) 1013–1022. (p. 258)Google Scholar

Chang, L. C., The uniqueness and nonuniqueness of the triangular association scheme , Sci. Record 3 (1959) 604–613. (pp. 5, 17, 273)Google Scholar

Chang, L. C., Association schemes of partially balanced block designs with parameters v = 28, n ₁ = 12, n ₂ = 15 and p ₁₁ ² = 4, Sci. Record 4 (1960) 12–18. (pp. 5, 17, 273)Google Scholar

Charnes, C. & Dempwolff, U., The translation planes of order 49 and their automorphism groups , Math. Comp. 67 (1998) 1207–1224. (p. 368)Google Scholar

Yip, Chi Hoi, On the clique number of Paley graphs of prime power order, arXiv:2004.01175, May 2020. (p. 192)Google Scholar

Chowla, S. & Ryser, H. J., Combinatorial problems , Canad. J. Math. 2 (1960) 93–99 (p. 201)Google Scholar

Chung, F. R. K., Graham, R. L. & , R. M. Wilson, Quasi-random graphs , Combinatorica 9 (1989) 345–362. (pp. 193, 241)Google Scholar

Cimráková, M. & Fack, V., Searching for maximal partial ovoids and spreads in generalized quadrangles , Bull. Belg. Math. Soc. Simon Stevin 12 (2005) 697–705. (p. 60)Google Scholar

Cioab, S. M.ă, Kim, Kijung & Koolen, J. H., On a conjecture of Brouwer involving the connectivity of strongly regular graphs , J. Combin. Th. (A) 119 (2012) 904–922. (pp. 14, 274)Google Scholar

Cioab, S. M.ă, Koolen, J. H. & Li, Weiqiang, Disconnecting strongly regular graphs , Europ. J. Combin. 38 (2014) 1–11. (p. 14)Google Scholar

Cioab, S. M.ă, Guo, Krystal & Haemers, W. H., The chromatic index of strongly regular graphs, Ars Mathematica Contemporanea, to appear. Also arXiv:1810.06660, Oct. 2018. (p. 245)Google Scholar

Clebsch, A., Ueber de Flächen vierter Ordnung, welche eine Doppelcurve zweiten Grades besitzen , J. Reine Angew. Math. 69 (1868) 142–184. (p. 267)Google Scholar

Cohen, A. M., Geometries originating from certain distance-regular graphs, pp. 81–87 in: Finite Geometries and Designs (Proc. Chelwood Gate, 1980), LMS Lecture Note Ser. 49, Cambridge Univ. Press, 1981. (p. 347)Google Scholar

Cohen, A. M., A new partial geometry with parameters (s, t, α) = (7, 8, 4), J. Geom. 16 (1981) 181–186. (p. 217)Google Scholar

Cohen, A. M., Point-line geometries related to buildings, pp. 647–737 in: Handbook of Incidence Geometry, Buildings and Foundations (ed. Buekenhout, F.), Chapter 9, North-Holland, Amsterdam, 1995. (pp. 134, 138)Google Scholar

Cohen, A. M. & Tits, J., On generalized hexagons and a near octagon whose lines have three points , Europ. J. Combin. 6 (1985) 13–27. (pp. 115, 347)Google Scholar

Cohen, A. M. & Zantema, H., A computation concerning doubly transitive permutation groups , J. Reine Angew. Math. 347 (1984) 196–211. (p. 383)Google Scholar

Cohen, G., Honkala, I., Litsyn, S. & Lobstein, A., Covering Codes, Elsevier, Amsterdam, 1997. (p. 156)Google Scholar

Cohen, N. & Pasechnik, D. V., Implementing Brouwer’s database of strongly regular graphs , Des. Codes Cryptogr. 84 (2017) 223–235. (pp. 199)Google Scholar

Cohen, S. D., Clique numbers of Paley graphs , Quaestiones Math. 11 (1988) 225–231. (p. 192)Google Scholar

Collins, B. V. C., Strongly regular square-free graphs with μ = 2, Europ. J. Combin. 18 (1997) 267–279. (p. 227)Google Scholar

Connor, W. S., The uniqueness of the triangular association scheme , Ann. Math. Statist. 29 (1958) 262–266. (p. 17)Google Scholar

Conway, J. H., A characterization of Leech’s lattice , Invent. Math. 7 (1969) 137–142. (Also [217], Ch. 12.) (p. 172)Google Scholar

Conway, J. H., Three lectures on exceptional groups, pp. 215–247 in: Finite Simple Groups, Powell, M. B. & Higman, G. (eds.), Academic Press, London, 1971. (Also [217], Ch. 10.) (p. 159)Google Scholar

Conway, J. H., Five $1,000 problems, http://oeis.org/A248380/a248380.pdf, (p. 17)Google Scholar

Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. & Wilson, R. A., Atlas of finite groups, Oxford Univ. Press, 1985. (pp. 50, 51, 52, 386)Google Scholar

Conway, J. H., Kleidman, P. B. & Wilson, R. A., New families of ovoids in O ₈ ⁺ , Geom. Dedicata 26 (1988) 157–170. (pp. 67, 72)Google Scholar

Conway, J. H. & Sloane, N. J. A., Sphere Packings, Lattices and Groups, Springer, New York etc., 1988. (pp. 172, 173, 432)Google Scholar

Conway, J. H. & Wales, D. B., Construction of the Rudvalis group of order 145 926 144 000 , J. Algebra 27 (1973) 538–548. (p. 372)Google Scholar

Conwell, G. M., The 3-space _PG(3, 2) and its group , Math. Ann. 51 (1899) 417–444. (p. 165)Google Scholar

Coolsaet, K., A construction of the simple group of Rudvalis from the group U ₃ (5) : 2, J. Group Th. 1 (1998) 143–163. (p. 372)Google Scholar

Coolsaet, K., The uniqueness of the strongly regular graph srg(105,32,4,12) , Bull. Belg. Math. Soc. Simon Stevin 12 (2005) 707–718. (pp. 16, 309, 402)Google Scholar

Coolsaet, K. & Degraer, J., Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes , Electr. J. Combin. 15 (2008) #R30. (pp. 16, 230, 323, 404)Google Scholar

Coolsaet, K., Degraer, J. & Spence, E., The strongly regular (45,12,3,3) graphs , Electr. J. Combin. 13 (2006) #R32. (pp. 16, 283, 400)Google Scholar

Coolsaet, K. & Juri, A.šić, Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs , J. Combin. Th. (A) 115 (2008) 1086–1095. (p. 26)Google Scholar

Cooperstein, B. N., On a connection between ovoids on the hyperbolic quadric O+ (10,_q) and the Lie incidence geometry E6,₁ (_q) , pp. 55–64 in: Groups and Geometries (Proc. Conf. Siena 1996), di Martino, L. et al. (eds.), Birkhäuser Verlag, Basel, 1998. (p. 135)Google Scholar

Corneil, D. G. & Mathon, R. A., Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations , Ann. Discr. Math. 2 (1978) 1–32. (p. 269)Google Scholar

Cossidente, A., Culbert, C., Ebert, G. L. & Marino, G., On m-ovoids of W₃ (q), Finite Fields Appl. 14 (2008) 76–84. (pp. 61, 282)Google Scholar

Cossidente, A., Durante, N., Marino, G., Penttila, T. & Siciliano, A., The geometry of some two-character sets , Des. Codes Cryptogr. 46 (2008) 231–241. (pp. 175, 182)Google Scholar

Cossidente, A. & King, O. H., Some two-character sets , Des. Codes Cryptogr. 56 (2010) 105–113. (p. 175)Google Scholar

Cossidente, A. & Marino, G., Veronese embedding and two-character sets , Des. Codes Cryptogr. 42 (2007) 103–107. (p. 175)Google Scholar

Cossidente, A. & Pavese, F., On intriguing sets of finite symplectic spaces , Des. Codes Cryptogr. 86 (2018) 1161–1174. (p. 62)Google Scholar

Cossidente, A. & Pavese, F., New Cameron–Liebler line classes with parameter (q² + 1)/2 , J. Alg. Combin. 49 (2019) 193–208. (p. 77)Google Scholar

Cossidente, A. & Penttila, T., Hemisystems on the Hermitian surface , J. London Math. Soc. 72 (2005) 731–741. (pp. 75, 223, 400, 417)Google Scholar

Cossidente, A. & Penttila, T., Segre’s hemisystem and McLaughlin’s graph , J. Combin. Th. (A) 115 (2008) 686–692. (p. 338)Google Scholar

Cossidente, A. & Van Maldeghem, H., The exceptional simple group O² (q), q even and two-character sets , J. Combin. Th. (A) 114 (2007) 964–969. (p. 175)Google Scholar

Coster, M. J. & Haemers, W. H., Quasi-symmetric designs related to the triangular graph , Des. Codes Cryptogr. 5 (1995) 27–42. (p. 207)Google Scholar

Coxeter, H. S. M., The complete enumeration of finite groups of the form ri2 = (rir i ) ki�� = 1 , J. London Math. Soc. 1 (1935) 21–25. (p. 118)Google Scholar

Coxeter, H. S. M., Regular Polytopes, 2nd ed., MacMillan, New York, 1963. (p. 271)Google Scholar

Craigen, R. & Kharaghani, H., Hadamard matrices and Hadamard designs, Chapter V.1., pp. 273– 280 in: Handbook of Combinatorial Designs, 2nd ed., Colbourn, C. J & Dinitz, J. H. (eds.), Chapman & Hall/CRC, Boca Raton, 2007. (p. 199)Google Scholar

Crnkovi, D.ć & Maksimovi, M.ć, Construction of strongly regular graphs having an automorphism group of composite order , Contrib. Discr. Math. 15 (2020) 22–41. (pp. 17, 400)Google Scholar

Crnkovi, D.ć & Mikuli, V.ć, Block designs and strongly regular graphs constructed from the group U (3, 4) , Glasnik Matematički 41 (2006) 189–194. (p. 347)Google Scholar

Crnkovi, D.ć, Pavese, F. & , A. Švob, On the PSU (4, 2)-invariant vertex-transitive strongly regular (216, 40, 4, 8) graph , Graphs Combin. 36 (2020) 503–513. (p. 283)Google Scholar

Crnkovi, D.ć, Rukavina, S. & Švob,, A. New strongly regular graphs from orthogonal groups O ⁺ (6, 2) and O ⁻ (6, 2), Discr. Math. 341 (2018) 2723–2728. (pp. 283, 350, 407)Google Scholar

Crnkovi, D.ć, Rukavina, S. & Švob,, A. On some distance-regular graphs with many vertices , J. Alg. Combin. 51 (2020) 641–652. (p. 379)Google Scholar

Crnkovi, D. ć,, A. Švob& Tonchev, V. D., New strongly regular graphs with parameters (81, 30, 9, 12) and a partial geometry pg(5, 5, 2), arXiv:2009.09544, 20 Sep. 2020 = Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry , J. Alg. Combin. 53 (2021) 253–261. (p. 301)Google Scholar

Curtis, R. T., A new combinatorial approach to M ₂₄ , Math. Proc. Cambridge Philos. Soc. 79 (1976) 25–42. (p. 158)Google Scholar

Cuypers, H., Extended near hexagons and line systems , Adv. Geom. 4 (2004) 181–214. (pp. 363, 366)Google Scholar

Cuypers, H. & Hall, J. I., The 3-transposition groups with trivial center , J. Algebra 178 (1995) 149–193. (p. 144)Google Scholar

Cvetkovi, D.ć, Rowlinson, P. & Simi, S.ć, Spectral generalizations of line graphs. On graphs with least eigenvalue −2 , LMS Lecture Note Ser. 314, Cambridge Univ. Press, 2004. (p. 7)Google Scholar

van Dam, E. R., Three-class association schemes , J. Alg. Combin. 10 (1999) 69–107. (p. 244)Google Scholar

van Dam, E. R. & Koolen, J. H., A new family of distance-regular graphs with unbounded diameter , Invent. Math. 162 (2005) 189–193. (p. 20)Google Scholar

van Dam, E. R., Koolen, J. H. & Tanaka, H., Distance-regular graphs , Electr. J. Combin. (2016) #DS22. (p. 19)Google Scholar

van Dam, E. R. & Muzychuk, M., Some implications on amorphic association schemes , J. Combin. Th. (A) 117 (2010) 111–127. (p. 187)Google Scholar

De Beule, J., Govaerts, P., Hallez, A. & Storme, L., Tight sets, weighted m-covers, weighted m-ovoids, and minihypers , Des. Codes Cryptogr. 50 (2009) 187–201. (p. 61)Google Scholar

De Beule, J., Klein, A., Metsch, K. & Storme, L., Partial ovoids and partial spreads in symplectic and orthogonal polar spaces , Europ. J. Combin. 29 (2008) 1280–1297. (pp. 60, 71)Google Scholar

De Beule, J., Klein, A., Metsch, K. & Storme, L., Partial ovoids and partial spreads in hermitian polar spaces , Des. Codes Cryptogr. 47 (2008) 21–34. (pp. 68, 81)Google Scholar

De Beule, J., Demeyer, J., Metsch, K. & Rodgers, M., A new family of tight sets in O+ (5,q) , Des. Codes Cryptogr. 78 (2016) 655–678. (p. 77)Google Scholar

De Beule, J. & Metsch, K., The Hermitian variety H (5, 4) has no ovoid , Bull. Belg. Math. Soc. Simon Stevin 12 (2006) 727–733. (p. 80)Google Scholar

De Beule, J. & Metsch, K., On the smallest non-trivial tight sets in Hermitian polar spaces , Electr. J. Combin. 24 (2017), no. 1, Paper No. 1.62, 13 pp. (pp. 82)Google Scholar

De Bruyn, B., Near Polygons, Birkhäuser Verlag, Basel, 2006. (p. 166)Google Scholar

De Bruyn, B., On hyperovals of polar spaces , Des. Codes Cryptogr. 56 (2010) 183–195. (p. 371)Google Scholar

De Bruyn, B., On some 2-tight sets of polar spaces , Ars. Combin. 133 (2017) 115–131. (p. 75)Google Scholar

De Bruyn, B. & Suzuki, H., Intriguing sets of vertices of regular graphs , Graphs Combin. 26 (2010) 629–646. (p. 10)Google Scholar

de Caen, D., The spectra of complementary subgraphs in a strongly regular graph , Europ. J. Combin. 19 (1998) 559–565. (p. 15)Google Scholar

De Clerck, F., Partial geometries, Ph. D. Thesis, Ghent University, 1978. (p. 217)Google Scholar

De Clerck, F. & Delanote, M., Partial geometries and the triality quadric , J. Geom. 68 (2000) 34–47. (pp. 217, 403, 404)Google Scholar

De Clerck, F., Delanote, M., Hamilton, N. & Mathon, R., Perp-systems and partial geometries , Adv. Geom. 2 (2002) 1–12. (p. 217)Google Scholar

De Clerck, F., Dye, R. H. & Thas, J. A., An infinite class of partial geometries associated with the hyperbolic quadric in _PG(4n − 1, 2) , Europ. J. Combin. 1 (1980) 323–326. (p. 216)Google Scholar

De Clerck, F., Gevaert, H. & Thas, J. A., Flocks of a quadratic cone in _PG(3,q), q ≤ 8, Geom. Dedicata 26 (1988) 215–230. (p. 328)Google Scholar

De Clerck, F. & Thas, J. A., The embedding of (0, α)-geometries in _PG(n, q ), Ann. Discr. Math. 18 (1983) 229–240. (p. 222)Google Scholar

De Clerck, F. & Van Maldeghem, H., Some classes of rank 2 geometries, pp. 433–475 in: Handbook of Incidence Geometry, Buekenhout, F., ed., North Holland, Amsterdam, 1995. (p. 224)Google Scholar

Debroey, I. & Thas, J. A., On semipartial geometries , J. Combin. Th. (A) 25 (1978) 242–250. (pp. 222, 224)Google Scholar

Degraer, J., Isomorph-free exhaustive generation algorithms for association schemes, Ph. D. Thesis, Ghent University, 2007. (pp. 16, 402)Google Scholar

Degraer, J. & Coolsaet, K., Classification of some strongly regular subgraphs of the McLaughlin graph , Discr. Math. 308 (2008) 395–400. (pp. 16, 315, 331, 403)Google Scholar

Delsarte, Ph., Weights of linear codes and strongly regular normed spaces , Discr. Math. 3 (1972) 47–64. (p. 175)Google Scholar

Delsarte, Ph., An algebraic approach to the association schemes of coding theory , Philips Res. Rep. Suppl. 10 (1973). (pp. 25, 31, 175)Google Scholar

Delsarte, Ph. & Goethals, J. M., Unrestricted codes with the Golay parameters are unique , Discr. Math. 12 (1975) 211–224. (p. 159)Google Scholar

Delsarte, Ph., Goethals, J. M. & Seidel, J. J., Spherical codes and designs , Geom. Dedicata 6 (1977) 363–388. (pp. 237, 238)Google Scholar

Delsarte, Ph., Goethals, J. M. & Seidel, J. J., Bounds for systems of lines, and Jacobi polynomials , Philips Research Reports 30 (1975) 91–105. (p. 235)Google Scholar

Dempwolff, U., Primitive rank 3 groups on symmetric designs , Des. Codes Cryptogr. 22 (2001) 191–207. (p. 376)Google Scholar

Denniston, R. H. F., Some maximal arcs in finite projective planes , J. Combin. Th. 6 (1969) 317–319. (pp. 179, 216)Google Scholar

Denniston, R. H. F., Some packings of projective spaces , Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 52 (1972) 36–40. (p. 111)Google Scholar

de Resmini, M. J., A 35-set of type (2,5) in _PG(2, 9) , J. Combin. Th. (A) 45 (1987) 303–305. (pp. 175, 183)Google Scholar

de Resmini, M. J. & Migliori, G., A 78-set of type (2,6) in _PG(2, 16) , Ars. Combin. 22 (196) 73–75. (pp. 175, 182)Google Scholar

De Schepper, A., Sastry, N. S. N., Van Maldeghem, H., Split buildings of type _F4 in buildings of type _E6 , Abh. Math. Sem. Univ. Hamburg 88 (2018) 97–160. (pp. 135, 136)Google Scholar

De Wispelaere, A., Huizinga, J., Van Maldeghem, H., Ovoids and spreads of the generalized hexagon _H(3) , Discr. Math. 305 (2005) 299–311. (p. 76)Google Scholar

De Wispelaere, A. & Van Maldeghem, H., Codes from generalized hexagons , Des. Codes Cryptogr. 37 (2005) 435–448. (pp. 175, 182)Google Scholar

De Wispelaere, A. & Van Maldeghem, H., Some new two-character sets in _PG(5,q ²) and a distance-2 ovoid in the generalized hexagon H (4) , Discr. Math. 308 (2008) 2976–2983. (pp. 76, 175)Google Scholar

De Wispelaere, A. & Van Maldeghem, H., On the Hall-Janko graph with 100 vertices and the near-octagon of order (2,4) , Contrib. Discr. Math. 4 (2009) 37–58 (pp. 306, 348)Google Scholar

Di Benedetto, D., Solymosi, J. & White, E. P., On the directions determined by a Cartesian product in an affine Galois plane, arXiv:2001.06994, Jun. 2020. (p. 192)Google Scholar

Dickson, L. E., The alternating group on eight letters and the quaternary linear congruence group modulo two , Math. Ann. 54 (1901) 564–569. (p. 165)Google Scholar

Dissett, L. A., Combinatorial and computational aspects of finite geometries, Ph. D. Thesis, Toronto, 2000. (pp. 182, 183)Google Scholar

Dixmier, S. & Zara, F., Etude d’un quadrangle généralisé autour de deux de ses points non liés, preprint, 1976. (p. 310)Google Scholar

Dixmier, S. & Zara, F., Essai d’une méthode d’étude de certains graphes liés aux groupes classiques , C. R. Acad. Sci. Paris (A) 282 (1976) 259–262. (pp. 310, 404)Google Scholar

Drudge, K., On a conjecture of Cameron and Liebler , Europ. J. Combin. 20 (1999) 263–269. (p. 77)Google Scholar

Ducey, J. E. & Sin, P., The Smith group and the critical group of the Grassmann graph of lines in finite projective space and of its complement , Bull. Inst. Math. Acad. Sin. (N.S.) 13 (2018) 411–442. (p. 259)Google Scholar

Ducey, J. E., Hill, I. & Sin, P., The critical group of the Kneser graph on 2-subsets of an n-element set , Lin. Alg. Appl. 546 (2018) 154–168. (p. 258)Google Scholar

Duval, A. M., A directed graph version of strongly regular graphs , J. Combin. Th. (A) 47 (1988) 71–100. (pp. 246, 248)Google Scholar

Dyck, Walther, Über Aufstellung und Untersuchung von Gruppe und Irrationalität regulärer Riemann’scher Flächen , Math. Ann. 17 (1880) 473–509. (p. 265)Google Scholar

Dye, R. H., Partitions and their stabilizers for line complexes and quadrics , Ann. Mat. Pura Appl. 114 (1977) 173–194. (p. 61)Google Scholar

Dye, R. H., Maximal sets of nonpolar points of quadrics and symplectic polarities over GF(2) , Geom. Dedicata 44 (1992) 281–293. (p. 60)Google Scholar

Ebert, G. L., Partitioning projective geometries into caps , Canad. J. Math. 37 (1985) 1163–1175. (p. 302)Google Scholar

Ebert, G. L. & Hirschfeld, J. W. P., Complete systems of lines on a hermitian surface over a finite field , Des. Codes Cryptogr. 17 (1999) 253–268. (p. 68)Google Scholar

Edge, W. L., The geometry of the linear fractional group LF(4, 2) Proc. London Math. Soc. (3) 4 (1954) 317–342. (p. 165)Google Scholar

Egawa, Y., Association schemes of quadratic forms , J. Combin. Th. (A) 38 (1985) 1–14. (p. 109)Google Scholar

Emms, D., Hancock, E. R., Severini, S. & Wilson, R. C., A matrix representation of graphs and its spectrum as a graph invariant , Electr. J. Combin. 13 (2006) #R34. (p. 241)Google Scholar

Enright, G. M., A description of the Fischer group F₂₂ , J. Algebra 46 (1977) 334–343. (p. 372)Google Scholar

Etzion, T. & Vardy, A., Automorphisms of codes in the Grassmann scheme, arXiv:1210.5724, Oct. 2012. (p. 111)Google Scholar

Euler, L., Recherches sur une nouvelle espèce de quarrés magiques , Verh. Zeeuwsch Genoot. Wetensch. Vlissingen 9 (1782) 85–239. Reprinted in Opera Omnia, Ser. I, Vol. VII, Teubner 1923, pp. 291–392. (p. 203)Google Scholar

van Eupen, M., Some new results for ternary linear codes of dimension 5 and 6 , IEEE Trans. Inf. Th. 41 (1995) 2048–2051. (p. 182)Google Scholar

van Eupen, M. & Hill, R., An optimal ternary [69, 5, 45] code and related codes , Des. Codes Cryptogr. 4 (1994) 271–282. (p. 301)Google Scholar

van Eupen, M. & Tonchev, V. D., Linear codes and the existence of a reversible Hadamard difference set in Z₂ × Z₂ × Z⁴ ₅ , J. Combin. Th. (A) 79 (1997) 161–167. (p. 181)Google Scholar

Exoo, G., Clique numbers for small Paley graphs, http://cs.indstate.edu/ge/Paley/cliques.html. (p. 192)Google Scholar

Exoo, G. & Jajcay, R., Dynamic cage survey , Electr. J. Combin. (2013) #DS16. (p. 288)Google Scholar

Farad, I. A.žev, Klin, M. H. & Muzichuk, M. E., Cellular rings and groups of automorphisms of graphs , pp. 1–152 in: Investigations in Algebraic Theory of Combinatorial Objects, Faradžev, I. A. et al. (eds.), Kluwer, Dordrecht, 1994. (pp. 325, 351)Google Scholar

Feit, W. & Higman, G., The nonexistence of certain generalized polygons , J. Algebra 1 (1964) 114–131. (p. 125)Google Scholar

Fellegara, G., Gli ovaloidi di uno spazio tridimensionale di Galois di ordine 8 , Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 32 (1962) 170#x2013;176. (p. 60)Google Scholar

Feng, T., Momihara, K. & Xiang, Q., Cameron-Liebler line classes with parameter x = q ²−1/2, J. Combin. Th. (A) 133 (2015) 307–338. (p. 77)Google Scholar

Feng, T., Momihara, K. & Xiang, Q., A family of m-ovoids of parabolic quadrics , J. Combin. Th. (A) 140 (2016) 97–111. (p. 72)Google Scholar

Feng, Tao & Tao, Ran, An infinite family of m-ovoids of Q(4,q) , Finite Fields Appl. 63 (2020) 101644. (p. 72)Google Scholar

Feng, Tao, Wang, Ye & Xiang, Qing, On m–ovoids of symplectic polar spaces , J. Combin. Th. (A) 175 (2020) 105279. (p. 61)Google Scholar

Feng, Tao & Xiang, Qing, Strongly regular graphs from unions of cyclotomic classes , J. Combin. Th. (B) 102 (2012) 982–995. (p. 186)Google Scholar

Fiala, N. C. & Haemers, W. H., 5-Chromatic strongly regular graphs , Discr. Math. 306 (2006) 3083–3096. (pp. 243, 244)Google Scholar

Fickus, M., Jasper, J., Mixon, D. G., Peterson, J. D. & Watson, C. E., Equiangular tight frames with centroidal symmetry , Appl. Comput. Harmon. Anal. 44 (2018) 476–496. (pp. 236, 403, 404, 410, 418)Google Scholar

Fickus, M., Jasper, J., Mixon, D. G. & Peterson, J., Tremain equiangular tight frames , J. Combin. Th. (A) 153 (2018) 54–66. (pp. 236, 404)Google Scholar

Fiedler, F. & Klin, M., A strongly regular graph with the parameters (v, k,l,λ, μ) = (512, 73, 438, 12, 10) and its dual graph, Preprint MATH-AL-7-1998, Technische Universität Dresden, July 1998, 23 pp. (pp. 182, 424)Google Scholar

Fischer, B., Finite groups generated by 3-transpositions. I , Invent. Math. 13 (1971) 232–246. (pp. 143, 146)Google Scholar

Fon-Der-Flaass, D. G., New prolific constructions of strongly regular graphs , Adv. Geom. 2 (2002) 301–306. (p. 17)Google Scholar

Foulser, D. A., Solvable primitive permutation groups of low rank , Trans. Amer. Math. Soc. 143 (1969) 1–54. (pp. 387, 389)Google Scholar

Foulser, D. A. & Kallaher, M. J., Solvable, flag-transitive, rank 3 collineation groups , Geom. Dedicata 7 (1978) 111–130. (pp. 187, 188, 387, 389)Google Scholar

Fujisaki, T., A four-class association scheme derived from a hyperbolic quadric in PG(3,q) , Adv. Geom. 4 (2004) 105–117. (p. 233)Google Scholar

Games, R. A., The packing problem for finite projective geometries, Ph. D. Thesis, Ohio State Univ., 1980. (pp. 180, 354)Google Scholar

The GAP Group, GAP – Groups, Algorithms, and Programming, https:www.gap-system.org. (p. 260)Google Scholar

Gavrilyuk, A. L., On tight sets of hyperbolic quadrics, arXiv:1911.04130v1, Nov. 2019. (p. 77)Google Scholar

Gavrilyuk, A. L. & Koolen, J. H., A characterization of the graphs of bilinear (d × d)-forms over F₂ , Combinatorica 39 (2019) 289–321. (p. 150)Google Scholar

Gavrilyuk, A. L. & Makhnev, A. A., О графах Крейна без треугольников, Dokl. Akad. Nauk 403 (2005) 727–730 (Russian) / On Krein graphs without triangles , Dokl. Math. 72 (2005) 591–594 (English). (pp. 17, 413)Google Scholar

Gavrilyuk, A. L. & Makhnev, A. A., On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph , Dokl. Akad. Nauk 428 (2009) 157–160 (Russian) / Dokl. Math. 80 (2009) 665#x2013;668. (p. 289)Google Scholar

Gavrilyuk, A. L. & Matkin, I., Cameron-Liebler line classes in _PG(3, 5) , J. Combin. Designs 26 (2018) 563–580. (p. 77)Google Scholar

Gavrilyuk, A. L. & Metsch, K., A modular equality for Cameron-Liebler line classes , J. Combin. Th. (A) 127 (2014) 224–242. (p. 77)Google Scholar

Ge, Gennian, Xiang, Qing & Yuan, Tao, Constructions of strongly regular Cayley graphs using index four Gauss sums , J. Alg. Combin. 37 (2013) 313–329. (pp. 184, 186)Google Scholar

Gewirtz, A., Graphs with maximal even girth , Canad. J. Math. 21 (1969) 915–934. (pp. 16, 303)Google Scholar

Gewirtz, A., The uniqueness of g(2, 2, 10, 56) , Trans. New York Acad. Sci. 31 (1969) 656–675. (pp. 16, 290)Google Scholar

Gleason, A. M., Weight polynomials of self-dual codes and the MacWilliams identities, pp. 211–215 in: Actes Congrès Intern. des Mathématiciens (Nice, 1970), Vol. 3, Gauthier-Villars, Paris, 1971. (p. 212)Google Scholar

Gijswijt, D. C., Mittelmann, H. D. & Schrijver, A., Semidefinite code bounds based on quadruple distances , IEEE Trans. Inf. Th. 58 (2012) 2697–2705. (p. 160)Google Scholar

Godsil, C. D., Krein covers of complete graphs , Australas. J. Combin. 6 (1992) 245–255. (pp. 232, 400, 403, 414, 424)Google Scholar

Godsil, C. D., Algebraic Combinatorics, Chapman and Hall, 1993. (p. 239)Google Scholar

Godsil, C. D., Guo, K. & Myklebust, T. G. J., Quantum walks on generalized quadrangles , Electr. J. Combin. 24 (2017) #P4.16. (p. 241)Google Scholar

Godsil, C. D. & McKay, B. D., Constructing cospectral graphs , Aequationes Math. 25 (1982) 257–268. (p. 235)Google Scholar

Godsil, C. D. & Meagher, K., Erdős-Ko-Rado Theorems: Algebraic Approaches, Cambridge Univ. Press, 2015. (p. 341)Google Scholar

Godsil, C. D. &Newman, M. W., Independent sets in association schemes , Combinatorica 26 (2006) 431–443. (p. 341)Google Scholar

Godsil, C. D. & Royle, G. F., Chromatic number and the 2-rank of a graph , J. Combin. Th. (B) 81 (2001) 142–149. (p. 254)Google Scholar

J.-Goethals, M. & Delsarte, P., On a class of majority logic decodable cyclic codes , IEEE Trans. Inf. Th. 14 (1968) 182–188. (p. 249)Google Scholar

J.-Goethals, M. & Seidel, J. J., Orthogonal matrices with zero diagonal , Canad. J. Math. 19 (1967) 1001–1010. (p. 200)Google Scholar

J.-Goethals, M. & Seidel, J. J., Quasisymmetric block designs, pp. 111–116 in: Combinatorial Structures and their Applications (Proc. Calgary 1969), Gordon and Breach, New York, 1970. (pp. 206, 315)Google Scholar

J.-Goethals, M. & Seidel, J. J., Strongly regular graphs derived from combinatorial designs , Canad. J. Math. 22 (1970) 597–614. (pp. 182, 198, 199, 206, 236, 309, 363, 399, 400, 401, 403, 404, 410, 418, 423)Google Scholar

J.-Goethals, M. & Seidel, J. J., The regular two-graph on 276 vertices , Discr. Math. 12 (1975) 143–158. (pp. 16, 229, 231, 337, 340)Google Scholar

Golay, M. J. E., Notes on digital coding , Proc. IRE 37 (1949) 657. (p. 156)Google Scholar

Golemac, A., Mandi, J.ć & Vu, T.čičić, New regular partial difference sets and strongly regular graphs with parameters (96, 20, 4, 4) and (96, 19, 2, 4) , Electr. J. Combin. 13 (2006) R88. (pp. 402)Google Scholar

Govaert, E. & Van Maldeghem, H., Distance-preserving maps in generalized polygons , Part II: Maps on points and/or lines , Beitr. Alg. Geom. 43 (2002) 303–324. (p. 133)Google Scholar

Govaerts, P. & Penttila, T., Cameron-Liebler line classes in _PG(3, 4) , Bull. Belg. Math. Soc. Simon Stevin 12 (2005) 793–804. (p. 77)Google Scholar

Govaerts, P. & Storme, L., On a particular class of minihypers and its applications. I. The result for general q , Des. Codes Cryptogr. 28 (2003) 51–63. (p. 182)Google Scholar

Graham, S.&Ringrose, C., Lower bounds for least quadratic non-residues , pp. 269–309 in: Analytic Number Theory (Proc. Allerton Park 1989), Berndt, B. C et al. (eds.), Birkhäuser, 1990. (p. 192)Google Scholar

Greaves, G. R. W., Koolen, J. H. & Park, Jongyook, Augmenting the Delsarte bound: A forbidden interval for the order of maximal cliques in strongly regular graphs , Europ. J. Combin. 97 (2021) 103384. (p. 13)Google Scholar

Greaves, G. R. W. & Soicher, L. H., On the clique number of a strongly regular graph , Electr. J. Combin. 25 (2018) #P4.15. (p. 12)Google Scholar

Greenwood, R. E. & Gleason, A. M., Combinatorial relations and chromatic graphs , Canad. J. Math. 7 (1955) 1–7. (p. 266)Google Scholar

Gritsenko, O., On strongly regular graph with parameters (65, 32, 15, 16), arXiv:2102.05432, Feb. 2021. (pp. 200, 401)Google Scholar

Grundh, T.öfer, Stroppel, M. J. & Van Maldeghem, H., Unitals admitting all translations , J. Combin. Designs 21 (2013) 419–431. (p. 91)Google Scholar

Grundh, T.öfer, Stroppel, M. J. & Van Maldeghem, H., A non-classical unital of order four with many translations , Discr. Math. 339 (2016) 2987–2993. (p. 332)Google Scholar

Gulliver, T. A., Two new optimal ternary two-weight codes and strongly regular graphs , Discr. Math. 149 (1996) 83–92. (pp. 182)Google Scholar

Gulliver, T. A., A new two-weight code and strongly regular graph , Appl. Math. Letters 9 (1996) 17–20. (p. 182)Google Scholar

Gunawardena, A. & Moorhouse, G. E., The non-existence of ovoids in O ₉ (q), Europ. J. Combin. 18 (1997) 171–173. (p. 70)Google Scholar

Guo, I., Koolen, J. H., Markowsky, G. & Park, J., On the nonexistence of pseudo-generalized quadrangles , Europ. J. Combin. 89 (2020) #103128. (p. 219)Google Scholar

Haemers, W. H., Sterke grafen en block designs, Afstudeerverslag (M. Sc. Thesis), Technische Hogeschool Eindhoven, Oct. 1975. (p. 264)Google Scholar

Haemers, W. H., An upper bound for the Shannon capacity of a graph , pp. 267–272 in: Algebraic Methods in Graph Theory (Szeged, 1978), Colloq. Math. Soc. János Bolyai Vol 25, North-Holland, Amsterdam, 1981. (p. 273)Google Scholar

Haemers, W. H., On some problems of Lovász concerning the Shannon capacity of graphs , IEEE Trans. Inf. Th. 25 (1979) 231–232. (p. 273)Google Scholar

Haemers, W. H., Eigenvalue techniques in design and graph theory , Ph. D. Thesis, Eindhoven Univ. of Technology, 1979. Also Math. Centre Tracts 121, Amsterdam, 1980. (pp. 13, 214, 244, 402)Google Scholar

Haemers, W. H., A new partial geometry constructed from the Hoffman-Singleton graph, pp. 119– 127 in: Finite Geometries and Designs (Proc. Chelwood Gate, 1980), LMS Lecture Note Ser. 49, Cambridge Univ. Press, 1981. (p. 217)Google Scholar

Haemers, W. H., There exists no (76,21,2,7) strongly regular graph, pp. 175–176 in: Finite Geometry and Combinatorics, De Clerck, F. et al. (eds.), LMS Lecture Note Ser. 191, Cambridge Univ. Press, 1993. (pp. 16, 211, 401)Google Scholar

Haemers, W. H., Strongly regular graphs with maximal energy , Lin. Alg. Appl. 429 (2008) 2719– 2723. (pp. 198, 199)Google Scholar

Haemers, W. H. & Kuijken, E., The Hermitian two-graph and its code , Lin. Alg. Appl. 356 (2002) 79–93. (pp. 229, 323) Google Scholar

Haemers, W. H. & Higman, D. G., Strongly regular graphs with strongly regular decomposition , Lin. Alg. Appl. 114 /115 (1989) 379–398. (p. 15)Google Scholar

Haemers, W. H. & van Lint, J. H., A partial geometry pg(9, 8, 4) , Ann. Discr. Math. 15 (1982) 205–212. (p. 217)Google Scholar

Haemers, W. H., Peeters, M. J. P. & van Rijckevorsel, J. M., Binary codes of strongly regular graphs , Des. Codes Cryptogr. 17 (1999) 187–209. (p. 255)Google Scholar

Haemers, W. H. & Spence, E., The pseudo-geometric graphs for generalised quadrangles of order (3,t) , Europ. J. Combin. 22 (2001) 839–845. (pp. 16, 294, 401)Google Scholar

Haemers, W. H. & Tonchev, V. D., Spreads in strongly regular graphs , Des. Codes Cryptogr. 8 (1996) 145–157. (pp. 244, 339)Google Scholar

Haemers, W. H. & Xiang, Qing, Strongly regular graphs with parameters (4m⁴, 2m⁴ + m², m⁴ + m², m⁴ + m²) exist for all m>1, Europ. J. Combin. 31 (2010) 1553–1559. (pp. 199)Google Scholar

Hall, J. I., On identifying _PG(3, 2) and the complete 3-design on seven points , Ann. Discr. Math. 7 (1980) 131–141. (p. 165)Google Scholar

Hall, J. I., Locally Petersen graphs , J. Graph Theory 4 (1980) 173–187. (pp. 148, 262)Google Scholar

Hall, J. I., On the order of Hall triple systems , J. Combin. Th. (A) 29 (1980) 261–262. (p. 147)Google Scholar

Hall, J. I., Classifying copolar spaces and graphs , Quart. J. Math. Oxford (2) 33 (1982) 421–449. (p. 151)Google Scholar

Hall, J. I., Graphs with constant link and small degree and order , J. Graph Theory 8 (1985) 419–444. (p. 4)Google Scholar

Hall, J. I., Graphs, geometry, 3-transpositions, and symplectic F ₂-transvection groups , Proc. London Math. Soc. (3) 58 (1989) 89–111. (pp. 148, 149)Google Scholar

Hall, J. I., Some 3-transposition groups with normal 2-subgroups , Proc. London Math. Soc. (3) 58 (1989) 112–136. (pp. 148, 149)Google Scholar

Hall, J. I., Local indecomposability of certain geometric graphs , Discr. Math. 106 /107 (1992) 243–254. (p. 148)Google Scholar

Hall, J. I. & Shult, E. E., Locally cotriangular graphs , Geom. Dedicata 18 (1985) 113–159. (pp. 148, 313)Google Scholar

Hall, M., jr., Automorphisms of Steiner triple systems , pp. 47–66 in: 1960 Institute on Finite Groups, Proc. Sympos. Pure Math. Vol. VI, Amer. Math. Soc., Providence, R.I., 1962. Also, IBM J. Res. Develop. 4 (1960) 460–472. (p. 147)Google Scholar

Hall, M., jr., Group theory and block designs, pp. 115–144 in: Proc. Canberra, 1965, Kov, L. G.ács & Neumann, B. H. (eds.), Gordon and Breach, New York, 1967. (p. 148)Google Scholar

Hall, M., jr., Combinatorial Theory, 2nd ed., Wiley, New York, 1986. (p. 201)Google Scholar

Hall, M., jr. &Connor, W. S., An embedding theorem for balanced incomplete block designs , Canad. J. Math. 6 (1953) 35–41. (p. 208)Google Scholar

jr.Hall, M. Lane, R. & Wales, D., Designs derived from permutation groups , J. Combin. Th. 8 (1970) 12–22. (p. 291)Google Scholar

Hall, M., jr. & Wales, D., The Simple Group of Order 604,800 , J. Algebra 9 (1968) 417–450. (p. 305)Google Scholar

Hamada, N., The rank of the incidence matrix of points and d-flats in finite geometries , J. Sci. Hiroshima Univ. Ser. A-I Math. 32 (1968) 381–396. (p. 249)Google Scholar

Hamada, N., On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes , Hiroshima Math. J. 3 (1973) 153–226. (p. 249)Google Scholar

Hamada, N., Characterization resp. nonexistence of certain q-ary linear codes attaining the Griesmer bound , Bull. Osaka Women’s Univ. 22 (1985) 1–47. (p. 182)Google Scholar

Hamada, N., Characterization of min·hypers in a finite projective geometry and its applications to error-correcting codes , Designs and finite geometries (Kyoto, 1986), RIMS Kōkyūroku No. 607 (1987) 52–69. (p. 182)Google Scholar

Hamada, N. & Helleseth, T., A characterization of some q-ary codes (q > (ℎ − 1)₂ , ℎ ≥ 3) meeting the Griesmer bound , Math. Japon. 38 (1993) 925–939. (p. 182)Google Scholar

Hamada, N. & Maekawa, T., A characterization of some q-ary codes (q >(ℎ − 1) ² , ℎ ≥ 3) meeting the Griesmer bound: Part 2 , Math. Japon. 46 (1997) 241–252. (p. 182)Google Scholar

Hamada, N. & Helleseth, T., A characterization of some {3v ₂ + v ₃ , 3v ₁ + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with b ₂ = 0, J . Stat. Plann. Infer. 56 (1996) 129–146. (p. 301)Google Scholar

Hämäläinen, H. & Rankinen, S., Upper bounds for football pool problems and mixed covering codes , J. Combin. Th. (A) 56 (1991) 84–95. (p. 156)Google Scholar

Hamilton, N., Strongly regular graphs from differences of quadrics, Discr . Math. 256 (2002) 465–469. (p. 179)Google Scholar

Hamilton, N. & Mathon, R., Existence and non-existence of m-systems of polar spaces , Europ. J. Combin. 22 (2001) 51–61. (p. 41)Google Scholar

Hammersley, J. M., The friendship theorem and the love problem , pp. 31–54 in: Surveys in Combinatorics (Keith Lloyd, E., ed.), LMS Lecture Note Ser. 82, Cambridge Univ. Press 1983. (p. 246)Google Scholar

Hanson, B. & Petridis, G., Refined estimates concerning sumsets contained in the roots of unity , Proc. London Math. Soc. (3) 122 (2021) 353–358. (p. 192)Google Scholar

Harada, M., Munemasa, A. & Tonchev, V. D., A characterization of designs related to an extremal doubly-even self-dual code of length 48 , Ann. Comb. 9 (2005) 189–198. (p. 210)Google Scholar

Harada, M., Munemasa, A. & Tonchev, V. D., Self-dual codes and the nonexistence of a quasi-symmetric 2-(37,9,8) design with intersection numbers 1 and 3 , J. Combin. Designs 25 (2017) 469–476. (p. 210)Google Scholar

Helfgott, H. A., Isomorphismes de graphes en temps quasi-polynomial [d’après Babai et Luks, Weisfeiler-Leman, …] , Séminaire Bourbaki. Vol. 2016/2017. Exposé 1125, Astérisque 407 (2019) 135–182. (p. 241)Google Scholar

Hering, C., Transitive linear groups and linear groups which contain irreducible subgroups of prime order , Geom. Dedicata 2 (1974) 425–460. (p. 383)Google Scholar

Hering, C., Transitive linear groups and linear groups which contain irreducible subgroups of prime order, II , J. Algebra 93 (1985) 151–164. (pp. 383, 387)Google Scholar

Hestenes, M. D. & Higman, D. G., Rank 3 groups and strongly regular graphs , pp. 141–159 in: Computers in Algebra and Number Theory (Proc. New York Symp., 1970), Birkhoff, G. & jr.Hall, M. (eds.), SIAM-AMS Proc., Vol IV, Providence, RI, 1971. (pp. 2, 6, 239)Google Scholar

Higman, D. G., Finite permutation groups of rank 3 , Math. Z. 86 (1964) 145–156. (p. 4)Google Scholar

Higman, D. G., Partial geometries, generalized quadrangles and strongly regular graphs , pp. 263– 293 in: Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Perugia, 1970), Univ. of Perugia, 1971. (p. 240)Google Scholar

Higman, D. G., Invariant relations, coherent configurations and generalized polygons , pp. 27–43 in: Combinatorics (Proc. NATO Advanced Study Inst., Breukelen, 1974), Part 3: Combinatorial group theory, Math. Centre Tracts 57, Math. Centrum, Amsterdam, 1974. (p. 26)Google Scholar

Higman, D. G., Coherent configurations, Part I , Geom. Dedicata 4 (1975) 1–32. Part II, Geom. Dedicata 5 (1976) 413–424. (p. 30)Google Scholar

Higman, D. G., Coherent algebras , Lin. Alg. Appl. 93 (1987) 209–239. (p. 30)Google Scholar

Higman, D. G. & Sims, C. C., A simple group of order 44,352,000 , Math. Z. 105 (1968) 110–113. (p. 303)Google Scholar

Higman, G., On the simple group of D. G. Higman and C. C. Sims , Illinois J. Math. 13 (1969) 74–80. (p. 330)Google Scholar

Hill, R., On the largest size of cap in S _5,3 , Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 54 (1973) 378–384. (pp. 180, 182, 354)Google Scholar

Hill, R., Caps and groups, pp. 389–394 in: Proc. Rome 1973, Atti dei Convegni Lincei, 1976. (pp. 180, 182, 186)Google Scholar

Hill, R., Caps and codes , Discr. Math. 22 (1978) 111–137. (p. 354)Google Scholar