Computing automorphisms and canonical labellings of graphs
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.
KeywordsAutomorphism Group Search Tree Graph Isomorphism Steiner Triple System Circulant Graph
Unable to display preview. Download preview PDF.
- D.G. Corneil, Graph Isomorphism, Ph.D. Thesis, Univ. of Toronto (1968).Google Scholar
- B.D. McKay, Backtrack programming and the graph isomorphism problem, M.Sc. Thesis, Univ. of Melbourne (1976).Google Scholar
- B.D. McKay, "Backtrack programming and isomorph rejection on ordered subsets", to appear in Proc. 5th Australian Conf. on Combin. Math. (1976).Google Scholar
- R. Parris, The coding problem for graphs, M.Sc. Thesis, Univ. of West Indies (1968).Google Scholar