Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Cameron P., Van Lint J., Designs, Graphs, Codes and their Links, London Math. Soc. Student Texts, 22, Cambridge Univ. Press, Cambridge, 1981, 240 pp. | MR
[2] Makhnev A. A., “Rasshireniya simmetrichnykh 2-skhem”, Tez. dokl. mezhdunar. konf. “Maltsevskie chteniya”, Novosibirsk, 2015, 112
[3] Brouwer A. E., Haemers W. H., “The Gewirtz graph: an exercize in the theory of graph spectra”, Europ. J. Comb., 14 (1993), 397–407 | DOI | MR | Zbl
[4] Behbahani M., Lam C., “Strongly regular graphs with non-trivial automorphisms”, Discrete Math., 311:2–3 (2011), 132–144 | DOI | MR | Zbl
[5] Cameron P. J., Permutation Groups, London Math. Soc. Student Texts, 45, Cambridge Univ. Press, Cambridge, 1999 | MR | Zbl
[6] Gavrilyuk A. L., Makhnev A. A., “Ob avtomorfizmakh distantsionno regulyarnogo grafa s massivom peresechenii $\{56,45,1;1,9,56\}$”, Dokl. AN, 432:5 (2010), 512–515
[7] Zavarnitsine A. V., “Finite simple groups with narrow prime spectrum”, Sib. electr. Math. Reports, 6 (2009), 1–12 | MR | Zbl