Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Transitive graphs with fewer than twenty vertices


Author: Brendan D. McKay
Journal: Math. Comp. 33 (1979), 1101-1121
MSC: Primary 05C25
DOI: https://doi.org/10.1090/S0025-5718-1979-0528064-2
MathSciNet review: 528064
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A graph is called transitive if its automorphism group acts transitively on the vertex set. We list the 1031 transitive graphs with fewer than 20 vertices, together with many of their properties.


References [Enhancements On Off] (What's this?)

  • [1] Mehdi Behzad and Gary Chartrand, Introduction to the theory of graphs, Allyn and Bacon Inc., Boston, Mass., 1971. MR 0432461
  • [2] Norman Biggs, Algebraic graph theory, Cambridge University Press, London, 1974. Cambridge Tracts in Mathematics, No. 67. MR 0347649
  • [3] C. GODSIL, Neighbourhoods of Transitive Graphs and GRR's, Mathematics Research Report No. 2, University of Melbourne, 1977.
  • [4] J. J. Seidel, Graphs and two-graphs, Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1974), Utilitas Math., Winnipeg, Man., 1974, pp. 125–143. Congressus Numerantium, No. X. MR 0364028
  • [5] H. P. Yap, Point-symmetric graphs with 𝑝≤13 points, Nanta Math. 6 (1973), no. 1, 8–20. MR 0332581

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 05C25

Retrieve articles in all journals with MSC: 05C25


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1979-0528064-2
Article copyright: © Copyright 1979 American Mathematical Society