Skip to main content
SpringerLink
Log in

Über die Bestimmung von Kernen in endlichen Graphen

On the determination of kernels in finite graphs

  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Die Arbeit befaßt sich mit einem Dekompositions- und einem Reduktionsverfahren zur Bestimmung der Kerne von endlichen Graphen. Sie enthält eine Reihe von Verallgemeinerungen bisher bekannter Kriterien für die Zugehörigkeit von gegebenen Knoten zu Kernen. Außerdem werden Kriterien zur Elimination von Knoten angegebenm die auf die Existenz eines Kerns keinen Einfluß haben.

Summary

The paper deals with a decomposition as well as a reduction procedure for the determination of kernels in finite graphs. It contains some generalizations of known criteria for the decision whether a given vertex may belong to a kernel of the graph or not. Furthermore, some criteria are given which serve to eliminate vertices without influence on the existence of a kernel.

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. Neumann, J. v., undO. Morgenstern: Theory of games and economic behavior. Princeton: Princeton University Press. 1953.

    Google Scholar 

  2. Richardson, M.: On weakly ordered systems. Bull. Amer. Math. Soc.52, 113–116 (1946).

    Google Scholar 

  3. Richardson, M.: Solutions of irreflexive relations. Annals of Math.58, 573–580 (1953).

    Google Scholar 

  4. Richardson, M.: Extensions theorems for solutions of irreflexive relations. Proc. Nat. Acad. of Sciences (U.S.A.)39, 649–651 (1953).

    Google Scholar 

  5. Berge, C.: Graphes et hypergraphes, S. 291. Paris: Dunod. 1970.

    Google Scholar 

  6. Grundy, P. M.: Mathematics and games. Eureka2, 6–8 (1939).

    Google Scholar 

  7. Rudeanu, S.: Notes sur l'existence et l'unicite du noyau d'un graphe. Revue Française Rech. Operat.33, 345–352 (1964).

    Google Scholar 

  8. Rudeanu, S.: Notes sur l'existence et l'unicite du noyau d'un graphe. II. Application des equations booleennes. Revue Française Rech. Operat41, 301–310 (1966).

    Google Scholar 

  9. Hammer, P. L., andS. Rudeanu: Boolean methods in operations research and related areas. Berlin-Heidelberg-New York: Springer. 1968.

    Google Scholar 

  10. Roy, B.: Algebre moderne et theorie des graphes, t. 2. p. 1–111, Paris: Dunod. 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für numerische Mathematik und Informationsverarbeitung, Universität Innsbruck, Innrain 52, 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. Über die Bestimmung von Kernen in endlichen Graphen. Computing 9, 139–147 (1972). https://doi.org/10.1007/BF02236963

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation