grape : a GAP 4 package - References

[BCN89]

A. E. Brouwer, A. M. Cohen, and A. Neumaier.
Distance-Regular Graphs.
Springer, Berlin, Heidelberg and New York, 1989.

[Cam99]

Peter J. Cameron.
Permutation Groups.
Cambridge University Press, 1999.
book's web-page: https://webspace.maths.qmul.ac.uk/p.j.cameron/permgps/pgbook.html.

[CSS99]

Hans Cuypers, Leonard H. Soicher, and Hans Sterk.
The small mathieu groups (project).
In Arjeh M. Cohen, Hans Cuypers, and Hans Sterk, editors, Some Tapas of Computer Algebra, volume 4 of Algorithms and Computation in Mathematics, pages 323--337. Springer, Berlin, Heidelberg and New York, 1999.

[Hae81]

Willem Haemers.
A new partial geometry constructed from the hoffman-singleton graph.
In P. J. Cameron, J. W. P. Hirschfeld, and D. R. Hughes, editors, Finite Geometries and Designs: Proceedings of the Second Isle of Thorns Conference 1980, volume 49 of London Mathematical Society Lecture Note Series, pages 119--127. Cambridge University Press, 1981.

[HL99]

Alexander Hulpke and Steve Linton.
Construction of Co3. An example of the use of an integrated system for Computational Group Theory.
In C. M. Campbell, E. F. Robertson, N. Ruskuc, and G. C. Smith, editors, Groups St Andrews 1997 in Bath, volume 260/261 of London Mathematical Society Lecture Note Series, pages 394--409. Cambridge University Press, 1999.

[JK07]

Tommi Juntilla and Petteri Kaski.
Engineering an efficient canonical labeling tool for large and sparse graphs.
In David Applegate et al., editor, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics, pages 135--149. SIAM, 2007.
bliss homepage: http://www.tcs.hut.fi/Software/bliss/.

[Lin04]

Steve Linton.
Finding the smallest image of a set.
In Jaime Gutierrez, editor, ISSAC '04: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pages 229--234. ACM Press, 2004.

[MP14]

Brendan D. McKay and Adolfo Piperno.
Practical graph isomorphism, ii.
J. Symbolic Comput., 60:94--112, 2014.
nauty and Traces homepage: https://pallini.di.uniroma1.it.

[PS97]

Cheryl E. Praeger and Leonard H. Soicher.
Low rank representations and graphs for sporadic groups, volume 8 of Australian Mathematical Society Lecture Series.
Cambridge University Press, 1997.

[Soi93]

Leonard H. Soicher.
GRAPE: a system for computing with graphs and groups.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation, volume 11 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 287--291. American Mathematical Society, 1993.

[Soi04]

Leonard H. Soicher.
Computing with graphs and groups.
In Lowell W. Beineke and Robin J. Wilson, editors, Topics in Algebraic Graph Theory, volume 102 of Encyclopedia of Mathematics and its Applications, pages 250--266. Cambridge University Press, 2004.

[Soi06]

Leonard H. Soicher.
Is there a McLaughlin geometry?
J. Algebra, 300:248--255, 2006.

[Soi24a]

Leonard H. Soicher.
Software for proper vertex-colouring exploiting graph symmetry.
In Kevin Buzzard et al., editor, Mathematical Software - ICMS 2024, volume 14749 of Lecture Notes in Computer Science, pages 106--112. Springer, Berlin, Heidelberg and New York, 2024.
accepted manuscript available at: https://webspace.maths.qmul.ac.uk/l.h.soicher/icms_soicher_v3.pdf.

[Soi24b]

Leonard H. Soicher.
Using GAP packages for research in graph theory, design theory, and finite geometry.
In Alexander A. Ivanov, editor, Algebraic Combinatorics and the Monster Group, volume 487 of London Mathematical Society Lecture Note Series, pages 527--566. Cambridge University Press, 2024.
accepted manuscript available at: https://webspace.maths.qmul.ac.uk/l.h.soicher/g2g2_final.pdf.

[Up]