Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-28T05:09:01.875Z Has data issue: false hasContentIssue false
  • English
  • Français

A regular endomorphism of a graph and its inverses

Part of: Graph theory

Published online by Cambridge University Press:  26 February 2010

Weimin Li
Weimin Li
Affiliation:
Fachbereich Mathematik, Universität Oldenburg, 26111 Oldenburg, Germany.
Get access

Abstract

In this paper, we first give a characterization of a regular endomorphism of a graph. Then, we explicitly describe its inverses through idempotents.

MSC classification

Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Type
Research Article
Information
Mathematika , Volume 41 , Issue 1 , June 1994 , pp. 189 - 198
Copyright
Copyright © University College London 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Harary, F.. (1969) Graph Theory (Addison-Wesley, Reading, 1969).Google Scholar
2.Howie, J. M.. An. introduction to semigroup theory (New York-London, 1976).Google Scholar
3.Knauer, U and Nieporte, M.. Endomorphisms of graphs I, The monoid of strong endomorphisms. Arch. Math., 52 (1989), 607–614.CrossRefGoogle Scholar
4.Knauer, U. Endomorphisms of graphs II, Various unretractive graphs. Arch. Math., 55 (1990), 193–203.CrossRefGoogle Scholar
5.Li, W-M.Green's relations on the endomorphoism monoids of graphs.SubmittedGoogle Scholar
6.Miller, D.D and Clifford, A. H.. Regular O-classes in semigroups. Trans. Amer. Math. Soc., 82 (1956), 270–280.Google Scholar
7.Wilkeit, E. Endormorphisms of graphs III, Graphs with a regular monoid. Submitted.Google Scholar
8.Problems raised at the problem session of the Colloquium on Semigroups in Szeged, August 1987. Semigroup Forum, 37 (1988), 367–373.Google Scholar