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.

**[1]**M. BEHZAD & G. CHARTRAND,*Introduction to the Theory of Graphs*, Allyn and Bacon, Boston, Mass., 1971. MR**0432461 (55:5449)****[2]**N. BIGGS,*Algebraic Graph Theory*, Cambridge Tracts in Mathematics No. 67, Cambridge, 1974. MR**0347649 (50:151)****[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,"*Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory and Computing*, Utilitas Math., Winnipeg, 1974. MR**0364028 (51:283)****[5]**H. P. YAP, "Point symmetric graphs with points,"*Nanta Math.*, v. 6, 1973, pp. 8-20. MR**0332581 (48:10907)**

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