Endomorphisms of graphs. I: The monoid of strong endomorphisms (Q1824632): Difference between revisions

[Part II, cf. the review below.] We use the fact that every graph is a generalized lexicographic product of an S-unretractive graph with sets, to show that the monoid of strong endomorphisms of any graph is isomorphic to a wreath product of a group with a certain small category. This implies information on algebraic properties of the monoid of strong endomorphisms. In particular, it is always a regular monoid.