Skip to main content
SpringerLink
Log in

Zur Bestimmung der Automorphismen eines endlichen Graphen

On the determination of the automorphisms of a finite graph

  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Bekannte Verfahren zum Nachweis der Isomorphie zwischen zwei endlichen GraphenG undG′ benutzen Informationen über die Automorphismengruppen beider Graphen. Die vorliegende Arbeit befaßt sich mit einer systematischen Darstellung dieser Information und enthält ein Algorithmenschema zur Bestimmung der Automorphismen eines Graphen.

Abstract

Effective procedures for the decision whether two finite graphs are isomorphic or not make use of some information about the automorphism groups of these graphs. The paper deals with a systematic representation of this information and proposes an algorithm scheme for the determination of the automorphisms of a graph.

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

Literatur

  1. Unger, S. H.: GIT — A heuristic Program for Testing Pairs of Directed Line Graphs for Isomorphism. Comm. ACM7, 26–34 (1964).

    Google Scholar 

  2. Corneil, D. G., Gotlieb, C. C.: An Efficient Algorithm for Graph Isomorphism. J. ACM17, 51–64 (1970).

    Google Scholar 

  3. Knödel, W.: Ein Verfahren zur Feststellung der Isomorphie von endlichen zusammenhängenden Graphen. Computing8, 329–334 (1971).

    Google Scholar 

  4. Sirovich, F.: Isomorfismi fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi. Calcolo8, 301–337 (1971).

    Google Scholar 

  5. Levi, G.: Graph Isomorphism: A Heuristic Edge — Partitioning — Oriented Algorithm. Computing12, 291–313 (1974).

    Google Scholar 

  6. Meyer, J. F.: Algebraic Isomorphism Invariants for Graphs of Automata, Graph Theory and Computing (Read, R. C., ed.). New York-London: Academic Press. 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Numerische Mathematik, Universität Innsbruck, J.-Hirn-Straße 5, A-6020, Innsbruck, Österreich

    G. Tinhofer

Authors
  1. G. Tinhofer
    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

Tinhofer, G. Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15, 147–156 (1975). https://doi.org/10.1007/BF02252863

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation