Skip to main content
Springer Nature Link
Log in

Algorithmus zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen

An algorithm to find isomorphism to finite and connected graphs

  • Algorithmen
  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Es wird überprüft, ob zwei endliche, zusammenhängende Graphen isomorph sind. Bei Isomorphie wird eine mögliche Abbildung angegeben.

Abstract

It will be examined, wether two finite and connected graphs are isomorphic or not. If an isomorphism exists, a possible correspondence will be constructed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literatur

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

    Google Scholar 

  2. Knödel, W.: Bestimmung aller maximalen, vollständigen Teilgraphen eines GraphenG nach Stoffers. Computing3, 239–240 (1968);4, 75 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pfennigäcker 24 a, D-7000, Stuttgart 71, Bundesrepublik Deutschland

    G. Bauersfeld, Ch. Essmann & H. Löhle

Authors
  1. G. Bauersfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ch. Essmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Löhle
    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

Bauersfeld, G., Essmann, C. & Löhle, H. Algorithmus zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. Computing 11, 159–168 (1973). https://doi.org/10.1007/BF02252905

Download citation

  • Received:

  • Issue Date:

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