Skip to main content

Tables of two-graphs

Special Invited Addresses

Part of the Lecture Notes in Mathematics book series (LNM,volume 885)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. L. Arlasarov, A. A. Lehman, M. S. Rosenfeld, The construction and analysis by a computer of the graphs on 25, 26 and 29 vertices (in Russian), Instit. of Control Theory, Moscow, 1975.

    Google Scholar 

  2. V. Belevitch, Conference networks and Hadamard matrices, Ann. Soc. Sci. Bruxelles, Sér I 82 (1968), 13–32.

    MathSciNet  MATH  Google Scholar 

  3. A. E. Brouwer, private communication.

    Google Scholar 

  4. F. C. Bussemaker, J. J. Seidel, Symmetric Hadamard matrices of order 36, Ann. N.Y. Acad. Sci. 175(1970), 66–79; Report Techn. Univ. Eindhoven 70-WSK-02, 68, (1970).

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. P. J. Cameron, Automorphisms and cohomology of switching classes, J. Combin. Theory B 22 (1977), 297–298.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. P. J. Cameron, Cohomological aspects of two-graphs, Math. Zeitschr. 157 (1977), 101–119.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. D. G. Corneil, R. A. Mathon, Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations, Ann. Discr. Math. 2 (1978), 1–32.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. J. M. Goethals, unpublished.

    Google Scholar 

  9. J. M. Goethals, J. J. Seidel, Orthogonal matrices with zero diagonal, Canad. J. Math., 19(1967), 1001–1010.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. S. Lang, Algebra, Addison-Wesley, (1965).

    Google Scholar 

  11. J. H. van Lint, J. J. Seidel, Equilateral point sets in elliptic geometry, Proc. Kon. Nederl. Akad. Wet., Ser. A, 69(1966), (-Indag. Math. 28), 335–348.

    MathSciNet  MATH  Google Scholar 

  12. C. L. Mallows, N.J.A. Sloane, Two-graphs, switching classes, and Euler graphs are equal in number, SIAM J. Appl. Math., 28(1975), 876–880.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. R. A. Mathon, Symmetric conference matrices of order pq2+1, Canad. J. Math., 30 (1978), 321–331.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. H. W. Norton, The 7×7 squares, Annals Eugenics 9(1939), 269–307.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. A. J. L. Paulus, Conference matrices and graphs of order 26, Report Techn. Univ. Eindhoven 73-WSK-06 (1973), 89.

    Google Scholar 

  16. A. W. Robinson, Enumeration of Euler graphs, in: Proof techniques in graph theory (ed. F. Harary), 47–53, Acad. Press (1969).

    Google Scholar 

  17. J. J. Seidel, A survey of two-graphs, Proc. Intern. Colloqu. Theorie Combinatorie (Roma 1973), Tomo I, Acad. Naz. Lincei, (1976), 481–511.

    Google Scholar 

  18. J. J. Seidel, Graphs and two-graphs, 5-th Southeastern Confer. on Combin., Graphs, Computing, Utilitas Math. Publ. Inc., Winnipeg (1974), 125–143.

    Google Scholar 

  19. J. J. Seidel, D. E. Taylor, Two-graphs, a second survey, Proc. Intern. Colloqu. Algebraic methods in graph theory, Szeged 1978, to be published.

    Google Scholar 

  20. J. J. Seidel, Strongly regular graphs, Proc. 7-th British Combin. Confer., Cambridge 1979.

    Google Scholar 

  21. D. E. Taylor, Regular 2-graphs, Proc. London Math. Soc., 35(1977), 257–274.

    CrossRef  MathSciNet  MATH  Google Scholar 

  22. B. Weisfeiler, On construction and identification of graphs, Lecture Notes, 558, Springer, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Bussemaker, F.C., Mathon, R.A., Seidel, J.J. (1981). Tables of two-graphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092256

Download citation

  • DOI: https://doi.org/10.1007/BFb0092256

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive