Fetching the paper…
Reading the bibliography…
Andries Brouwer maintains a public database of existence results for strongly regular graphs on $n\leq 1300$ vertices.
Tournaments and Hadamard matrices
G. Szekeres · 1969
Earlier work this paper cites.
A skew Hadamard matrix of order 36 36
J.-M. Goethals and J. J. Seidel · 1970
Earlier work this paper cites.
Strongly regular graphs derived from combinatorial designs
J.-M. Goethals and J. J. Seidel · 1970
Earlier work this paper cites.
A skew-Hadamard matrix of order 92 92
J. Wallis · 1971
Earlier work this paper cites.
Some classes of Hadamard matrices with constant diagonal
J. Wallis and A. L. Whiteman · 1972
Earlier work this paper cites.
Combinatorics: Room squares, sum-free sets, Hadamard matrices
W. D. Wallis, A. P. Street, and J. S. Wallis · 1972
Earlier work this paper cites.
The regular two-graph on 276 276 vertices
J.-M. Goethals and J. J. Seidel · 1975
Earlier work this paper cites.
Strongly regular graphs
X. L. Hubaut · 1975
Earlier work this paper cites.
Symmetric conference matrices of order p q 2 + 1 pq^{2}+1
R. Mathon · 1978
Earlier work this paper cites.
A new partial geometry constructed from the Hoffman-Singleton graph
W. Haemers · 1981
Earlier work this paper cites.
Two-graphs, a second survey
J. J. Seidel and D. E. Taylor · 1981
Earlier work this paper cites.
Polarities of G. Higman’s symmetric design and a strongly regular graph on 176 176 vertices
A. E. Brouwer · 1982
Earlier work this paper cites.
Association schemes, 1982
H. D. L. Hollmann · 1982
Earlier work this paper cites.
Strongly regular graphs and partial geometries
A. E. Brouwer and J. H. van Lint · 1984
Earlier work this paper cites.
The primitive representations of the non-abelian simple groups of order less than 10 6 10^{6} , part II
A. A. Ivanov, M. H. Klin, and I. A. Faradjev · 1984
Earlier work this paper cites.
A new strongly regular graph
R. Mathon and A. Rosa · 1985
Earlier work this paper cites.
Uniqueness and nonexistence of some graphs related to M 22 M_{22}
A. E. Brouwer · 1986
Earlier work this paper cites.
Combinatorial theory
M. Hall, Jr · 1986
Earlier work this paper cites.
Distance-regular graphs
A. E. Brouwer, A. M. Cohen, and A. Neumaier · 1989
Earlier work this paper cites.
Computer package for computations with coherent configurations
I. A. Faradjev and M. H. Klin · 1991
Cited alongside, same era.
On the p p -rank of the adjacency matrices of strongly regular graphs
A. E. Brouwer and C. A. van Eijl · 1992
Cited alongside, same era.
Krein covers of complete graphs
C. D. Godsil · 1992
Cited alongside, same era.
Skew-symmetric association schemes with two classes and strongly regular graphs of type L 2 n − 1 ( 4 n − 1 ) L_{2n-1}(4n-1)
D. V. Pasechnik · 1992
Cited alongside, same era.
Spreads in strongly regular graphs
W. H. Haemers and V. D. Tonchev · 1996
Cited alongside, same era.
Combinatorial and computational aspects of finite geometries
L. A. Dissett · 2000
Cited alongside, same era.
Constructing two-weight codes with prescribed groups of automorphisms
A. Kohnert · 2007
Later among the works it cites.
A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs
M. Muzychuk · 2007
Later among the works it cites.
Classification of some strongly regular subgraphs of the mclaughlin graph
J. Degraer and K. Coolsaet · 2008
Later among the works it cites.
On a class of strongly regular designs and quasi-semisymmetric designs
T. Huang, L. Huang, and M.-I. Lin · 2009
Later among the works it cites.
Finite generalized quadrangles
S. E. Payne and J. A. Thas · 2009
Later among the works it cites.
Negative Latin square type partial difference sets and amorphic association schemes with Galois rings
J. Polhill · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs
Z. Janko, H. Kharaghani, and V. D. Tonchev · 2001
Cited alongside, same era.
New prolific constructions of strongly regular graphs
D. G. Fon-Der-Flaass · 2002
Cited alongside, same era.
A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
Z. Janko and H. Kharaghani · 2002
Cited alongside, same era.
Some new results on optimal codes over 𝔽 5 \mathbb{F}_{5}
I. Bouyukliev and J. Simonis · 2003
Cited alongside, same era.
New families of strongly regular graphs
Y. J. Ionin and H. Kharaghani · 2003
Cited alongside, same era.
Switching of edges in strongly regular graphs. I. A family of partial difference sets on 100 vertices
L. K. Jørgensen and M. Klin · 2003
Cited alongside, same era.
Examples of computer experimentation in algebraic combinatorics
M. Klin, C. Pech, S. Reichard, A. Woldar, and M. Ziv-Av · 2010
Later among the works it cites.
Spectra of graphs
A. E. Brouwer and W. H. Haemers · 2012
Later among the works it cites.
Four mutually orthogonal Latin squares of order 14
D. T. Todorov · 2012
Later among the works it cites.
On Borsuk’s conjecture for two-distance sets
A. Bondarenko · 2014
Later among the works it cites.
A 64-dimensional counterexample to Borsuk’s conjecture
T. Jenrich and A. E. Brouwer · 2014
Later among the works it cites.
Existence of five MOLS of orders 18 and 60
R. J. R. Abel · 2015
Later among the works it cites.
Online database of two-weight codes
E. Chen · 2015
Later among the works it cites.
GAP – Groups, Algorithms, and Programming, Version 4.7.9
The GAP Group · 2015
Later among the works it cites.
graphs.IoninKharaghani765Graph
N. Cohen · 2016
Closest in time.
Sagemath: Database of strongly regular graphs
N. Cohen, D. Pasechnik, et al · 2016
Closest in time.
Sage Mathematics Software (Version 7.3)
T. S. Developers · 2016
Closest in time.
New families of strongly regular graphs
Y. J. Ionin and H. Kharaghani · 2016
Closest in time.