Abstract
A new algorithm is presented for the related problems of canonically labelling a graph or digraph and of finding its automorphism group. The automorphism group is found in the form of a set of less than n generators, where n is the number of vertices. An implementation is reported which is sufficiently conserving of time and space for it to be useful for graphs with over a thousand vertices.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Behzad and G. Chartrand, Introduction to the theory of graphs, Allyn and Bacon, Boston (1971).
D.G. Corneil, Graph Isomorphism, Ph.D. Thesis, Univ. of Toronto (1968).
B.D. McKay, Backtrack programming and the graph isomorphism problem, M.Sc. Thesis, Univ. of Melbourne (1976).
B.D. McKay, "Backtrack programming and isomorph rejection on ordered subsets", to appear in Proc. 5th Australian Conf. on Combin. Math. (1976).
R. Parris, The coding problem for graphs, M.Sc. Thesis, Univ. of West Indies (1968).
J.P. Steen, "Principle d'un algorithme de recherche d'un isomorphisme entre deux graphes", RIRO, R-3, 3 (1969), 51–69.
H. Wielandt, Finite permutation groups, Academic Press, New York and London (1964).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
McKay, B.D. (1978). Computing automorphisms and canonical labellings of graphs. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062536
Download citation
DOI: https://doi.org/10.1007/BFb0062536
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive