18
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices

&
Pages 143-151 | Published online: 19 Mar 2007

References

  • Bose , R. C. 1963 . Strongly regular graphs, partial geometries and partially balanced designs . Pacific J. Math , 13 : 389 – 419 .
  • Brouwer , A. E. and van Lint , J. H. “ Strongly regular graphs and partial geometries, ” . In Enumeration and Design, Edited by: Jackson , M. and Vanstone , S. 85 – 122 . Acad. Press, .
  • Cameron P. J. van Lint J. H. Graphs, codes and designs London Math. Soc. Lecture Notes Series 43 Cambridge 1980
  • Cameron , P. J. “ Automorphism groups of graphs ” . In Graph Theory 2 , Academic Press Inc. .
  • Hubaut , X. L. 1975 . Strongly regular graphs . Discrete Math. , 13 : 357 – 381 .
  • Seidel , J. J. 1979 . “ Strongly regular graphs, in: Surveys in Combinatorics, Proc. 7th Brit. Comb. Conf. ” . In London Math. Soc , Edited by: Bollobas , B. 157 – 180 . Cambridge : Lecture Notes Series 38 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.