Switching of edges in strongly regular graphs. I. A family of partial difference sets on 100 vertices

Electronic Journal of Combinatorics

Volumn 10, Issue 1 R, 2003, Pages

  Jorgensen L K ^a   Klin, M ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042578220     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1710     Document Type: Article

References (55)

1. [Asc94] M. Aschbacher, Sporadic groups, Cambridge Tracts in Mathematics 104, Cambridge University Press, 1994.
2. [Bab77] L. Bábái, Isomorphism problem for a class of point-symmetric structures, Acta Math. Acad. Sci. Hung. 29, 329-336, 1977.
3. [Bag88] B. Bagchi, A new strongly regular graph admitting the Hall-Janko-Wales group. Tech. Report No. 13/88. Stat.-Math. Division, Indian Statistical Institute, Calcutta, Sept.23, 1988.
4. [Bag92] B. Bagchi, A regular two-graph admitting the Hall-Janko-Wales group. Sankhya, Ser. A, Spec. Volume 54, 35-45, 1992.
5. [BetJL93] T. Beth, D. Jungnickel and H. Lenz, Design theory, Cambridge University Press, 1993.
6. [BhaS68] Bhagwandas and S. S. Shrikhande, Seidel-equivalence of strongly regular graphs, Sankhya, Ser. A 30, 359-368, 1968.
7. [BosPS60] R. C. Bose, E. T. Parker and S. S. Shrikhande, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Canad. J. Math. 12, 189-203, 1960.
8. [Bro] A. E. Brouwer, Unix implementation of COCO, (http://www.win.tue.nl/ ~aeb/).
9. [ Bro96] A. E. Brouwer, Strongly regular graphs, in: The CRC Handbook of Combinatorial Designs (eds.: Colbourn and Dinitz), 667-685, CRC Press, 1996.
10. [BusS70] F. C. Bussemaker and J. J. Seidel, Symmetric Hadamard matrices of order 36, Annals of the New York Acad. of Sciences 175, 66-79, 1970.
11. [Cam99] P. J. Cameron, Permutation Groups, London Mathematical Society Student Texts 45, Cambridge University Press, 1999.
12. [CamL91] P. J. Cameron and J. H. van Lint, Designs, graphs, codes and their links, London Mathematical Society Student Texts 22, Cambrigde University Press, 1993.
13. [Dam99] E. R. van Dam, Three-class association schemes, J. Algebraic Combin. 10, 69-107, 1999.
14. [FarK91] I. A. Faradžev and M. H. Klin, Computer package for computations with coherent configurations, Proc. of the 1991 Intern. Symp. on Symb. and Algebraic Computations, ISSAC'91 (Bonn, July 15-17, 1991), ACM Press, 219-223.
15. [FarKM94] I. A. Faradžev, M. H. Klin and M. E. Muzichuk, Cellular rings and groups of automorphisms of graphs, in: Investigations in algebraic theory of combinatorial objects (eds.: Faradžev, Ivanov, Klin and Woldar), Kluwer Academic Publishers, 1994, pp. 1-152.
16. [FinR73] L. Finkelstein and A. Rudvalis, Maximal subgroups of the Hall-Janko-Wales group, J. Algebra 24, 486-493, 1973.
17. 6 - Maximal subgroups. Math. Comput. 32, 1293-1302, 1978.
18. [GAP] The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.1 , Aachen, St Andrews, 1999, (http://www-gap.dcs.st-and.ac.uk/~gap).
19. [Gew69] A. Gewirtz, Graphs with maximal even girth, Canad. J. Math. 21, 915-934, 1969.
20. [GodM82] C. D. Godsil and B. D. McKay, Constructing cospectral graphs, Aequationes Math. 25, 257-268, 1982.
21. [GoeS70] J.-M. Goethals and J.J. Seidel, Strongly regular graphs derived from combinatorial designs, Canad. J. Math. 22, 597-614, 1970.
22. [GolV01] A. Golemac and T. Vučičić, New difference sets in nonabelian groups of order 100, J. Combin. Designs 9, 424-434, 2001.
23. [GolV02] A. Golemac and T. Vučičić, New (100,45,20) symmetric designs and Bush-type Hadamard matrices of order 100, Discr. Math. 245, 263-272, 2002.
24. [HaeH89] W. H. Haemers and D. G. Higman, Strongly regular graphs with strongly regular decompositions, Linear Algebra Appl. 114(115), 379-398, 1989.
25. [Hal47] M. Hall, Cyclic projective planes, Duke Math. J. 14, 1079-1090, 1947.
26. [HalW68] M. Hall, Jr. and D. Wales, The simple group of order 604,800, J. Algebra 9 417-450, 1968.
27. [Hae84] W. Haemers, Dual Seidel switching, EUT-Rep., Eindhoven 84-WSK-03, 183-191, 1984.
28. [HeiK] A. Heinze and M. Klin, Constructive enumeration of partial difference sets. I. Enumeration of partial difference sets over the groups of order at most 49. In preparation.
29. [HesH71] M. D. Hestenes and D. G. Higman, Rank 3 groups and strongly regular graphs, SIAM-AMS Proceedings 4, 141-159, 1971.
30. [HigS68] D. G. Higman and C. C. Sims, A simple group of order 44,352,000, Math. Zeitschrift 105 110-113, 1968.
31. [HugP85] D. R. Hughes and F. C. Piper, Design Theory, Cambridge University Press, 1985.
32. 6 (in Russian), Part 1, preprint, M., VNIISI, 1982.
33. 6 (in Russian), Part 2, preprint, M., VNIISI, 1984.
34. [Jan69] Z. Janko, Some new simple groups of finite order. I, Symposia Mathematica (INDAM, Rome, 1967/68), 1, 25-64, Academic Press, 1969.
35. [JanKT01] Z. Janko, H. Kharaghani and V. D. Tonchev, Bush-type Hadamard matrices and symmetric designs, J. Combin. Designs 9, 72-78, 2001.
36. [Kli00] M. Klin, Partial difference sets for known and new strongly regular graphs. In: Summer School ALCCAL 2000. Algebraic Combinatorics and Computer Algebra. September 3-14, 2000, Varna, Bulgaria. Inst. of Math. and Inform., Bulgarian Academy of Sciences. Sofia 2000, pp. 59-60.
37. [KliPR88] M. Ch. Klin, R. Pöschel and K. Rosenbaum, Angewandte Algebra für Mathematiker und Informatiker, VEB Deutscher Verlag der Wissenschaften, Berlin, 1988.
38. 6, Comm. Algebra 14, 1623-1678, 1986.
39. [Lie99] R.A.Liebler. Constructive representation theoretic methods and non-abelian difference sets, in: Difference sets, sequences and their correlation properties (eds: Pott, Kumar, Helleseth, Jungnickel), Kluwer Academic Publishers, 1999, pp. 331-352.
40. [vLinS66] J. H. van Lint and J. J. Seidel, Equilateral point sets in elliptic geometry, Indag. Math. 28, 335-348, 1966.
41. 5(10) association scheme, Chin. Ann. of Math. 48, 355-356, 1983.
42. [Ma84] S. L. Ma, Partial difference sets, Discrete Math. 52, 75-89, 1984.
43. [Ma94] S. L. Ma, A survey of partial difference sets, Des. Codes Cryptogr. 4, 221-261, 1994.
44. [Mag71] S. S. Magliveras, The subgroup structure of the Higman-Sims simple group, Bull. Amer. Math. Soc. 77, 535-539, 1971.
45. [McKay90] B.D. McKay, nauty user's guide (version 1.5), Technical report TR-CS-90-02, Australian National University, Computer Science Department, ANU, 1990.
46. [MuzK98] M. Muzychuk and M. Klin, On graphs with three eigenvalues, Discrete Math. 189, 191-207, 1998.
47. [Rog84] N. N. Roghelia and S. S. Sane, Classification of (16,6,2)-designs by ovals, Discrete Math. 51, 161-177, 1984.
48. [Rud71] A. Rudvalis, (v, k, λ)-graphs and polarities of (v, k, λ)-designs, Math. Zeitschr. 120, 224-230, 1971.
49. 2-type and of triangular type, Indag. Math. 29, 188-196, 1967.
50. [Soi93] L. H. Soicher. GRAPE: a system for computing with graphs and groups. In: Groups and Computation (eds.: Finkelstein and Kantor), volume 11 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 287-291. American Mathematical Society, 1993.
51. [Smi95] K. W. Smith, Non-abelian Hadamard difference sets, J. Combin. Theory Ser. A 70, 144-156, 1995.
52. [Tur65] R. J. Turyn, Character sums and difference sets, Pacific J. Math. 15, 319-346, 1965.
53. [Vǔc00] T. Vučičić, New symmetric designs and nonabelian difference sets with parameters (100,45,20), J. Combin. Designs 8, 291-299, 2000.
54. [Wal69] D. Wales, Uniqueness of the graph of a rank three group, Pacific J. Math. 30, 271-276, 1969.
55. [Wil85] R. A. Wilson, Maximal subgroups of automorphism groups of simple groups, J. London Math. Soc. (2) 32, 460-466, 1985.