Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
The electronic journal of combinatorics, Tome 10 (2003)
We present 15 new partial difference sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial difference sets have the following parameters: (100,22,0,6), (100,36,14,12), (100,45,20,20), (100,44,18,20). The existence of strongly regular graphs with the latter set of parameters was an open question. Our method is based on combination of Galois correspondence between permutation groups and association schemes, classical Seidel's switching of edges and essential use of computer algebra packages. As a by-product, a few new amorphic association schemes with 3 classes on 100 points are discovered.
@article{10_37236_1710,
author = {L. K. J{\o}rgensen and M. Klin},
title = {Switching of edges in strongly regular graphs. {I:} {A} family of partial difference sets on 100 vertices},
journal = {The electronic journal of combinatorics},
year = {2003},
volume = {10},
doi = {10.37236/1710},
zbl = {1011.05063},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1710/}
}
TY - JOUR AU - L. K. Jørgensen AU - M. Klin TI - Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices JO - The electronic journal of combinatorics PY - 2003 VL - 10 UR - http://geodesic.mathdoc.fr/articles/10.37236/1710/ DO - 10.37236/1710 ID - 10_37236_1710 ER -
L. K. Jørgensen; M. Klin. Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1710
Cité par Sources :