conf2graph.06 | conf2graph.10 | conf2graph.14 | conf2graph.18 | conf2graph.26 |
conf2graph.30 | conf2graph.38 | conf2graph.42 | conf2graph.46 | conf2graph.50 |
Perhaps the updated files concerning conference two-graphs on 38, 42 and 46
vertices need some explanation. In [1] 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 [2] 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 [4] increased the known number of
conference two-graphs on 50 vertices to 54 (6 self-complementary and
24 complementary pairs).
[1] Brendan McKay & E Spence, The Classification of Regular Two-graphs on 36 and 38 vertices, Australas. J. Combin.. 24 (2001), 293-300.
[2] R, Mathon, On self-complementary strongly regular graphs,
Discrete Math. 69 (1988), 263-281.
[3] R, Mathon, On self-complementary strongly regular graphs,
Discrete Math. 69 (1988), 263-281.
[4] E. Spence, Unpublished computer result, 1995.