Publications 2-designs Two Graphs Hadamard
Matrices Regular graphs
eigenvalues Steiner S(2,4,25) Strongly Regular
graphs on at
most 64 vertices Symmetric
Perhaps the updated files concerning conference two-graphs on 38, 42 and 46
vertices need some explanation. In  the method used to determine all
regular two-graphs on 36 vertices was adapted to generate 191 conference
twographs on 38 vertices, with similar results for 42,
while Mathon  found 17 self-complementary strongly
regular graphs on 45 vertices that give rise to the same number of
self-complementary regular two-graphs on 46 vertices, and the
additional work  increased the known number of
conference two-graphs on 50 vertices to 54 (6 self-complementary and
24 complementary pairs).
 Brendan McKay & E Spence, The Classification of Regular Two-graphs on 36 and 38 vertices, Australas. J. Combin.. 24 (2001), 293-300.
 R, Mathon, On self-complementary strongly regular graphs, Discrete Math. 69 (1988), 263-281.