Transitive graphs with fewer than twenty vertices
HTML articles powered by AMS MathViewer
- by Brendan D. McKay PDF
- Math. Comp. 33 (1979), 1101-1121 Request permission
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
- Mehdi Behzad and Gary Chartrand, Introduction to the theory of graphs, Allyn and Bacon, Inc., Boston, Mass., 1971. MR 0432461
- Norman Biggs, Algebraic graph theory, Cambridge Tracts in Mathematics, No. 67, Cambridge University Press, London, 1974. MR 0347649 C. GODSIL, Neighbourhoods of Transitive Graphs and GRR’s, Mathematics Research Report No. 2, University of Melbourne, 1977.
- 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), Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man., 1974, pp. 125–143. MR 0364028
- H. P. Yap, Point-symmetric graphs with $p\leq 13$ points, Nanta Math. 6 (1973), no. 1, 8–20. MR 332581
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Math. Comp. 33 (1979), 1101-1121
- MSC: Primary 05C25
- DOI: https://doi.org/10.1090/S0025-5718-1979-0528064-2
- MathSciNet review: 528064