Skip to main content
SpringerLink
Log in

An algorithm for determining the automorphism partitioning of an undirected graph

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

An Algol 60 program for determining the automorphism partitioning of an undirected unlabelled graph is presented. For graphs that do not contain strongly regular subgraphs, the time is at worstO(n 4) wheren is the number of vertices in the graph. The algorithm is based on the Corneil-Gotlieb conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. G. Corneil and C. C. Gotlieb,An efficient algorithm for graph isomorphism, J.A.C.M. 17,1 (Jan. 1970), 51–64.

    Google Scholar 

  2. D. G. Corneil,Graph Isomorphism, Ph. D. thesis, U. of Toronto, Canada (1968). Available as a Department of Computer Science Technical Report (1970).

  3. E. Sussenguth, Jr.,A graph theoretical algorithm for matching chemical structures, J. Chem. Doc. 5,1 (Feb. 1965), 36–43.

    Article  Google Scholar 

  4. S. H. Unger,GIT—a heuristic program for testing pairs of directed line graphs for isomorphism, Comm. A.C.M. 7,1 (Jan. 1964), 26–34.

    Google Scholar 

  5. C. Bohm, and A. Santolini,A quasi-decision algorithm for the p-equivalence of two matrices, ICC Bull. 3,1 (1964), 57–69.

    Google Scholar 

  6. J. W. Moon and L. Moser,On cliques in graphs, Israel. J. Math. 3 (March 1965), 23–28.

    Google Scholar 

  7. R. C. Bose,Strongly regular graphs, partial geometries and partially balanced design, Pacific J. Math. 13 (1963), 389–420.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Ontario, Canada

    D. G. Corneil

Authors
  1. D. G. Corneil
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corneil, D.G. An algorithm for determining the automorphism partitioning of an undirected graph. BIT 12, 161–171 (1972). https://doi.org/10.1007/BF01932810

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932810

Keywords

Search

Navigation