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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Endomorphisms of graphs. I: The monoid of strong endomorphisms
scientific article

    Statements

    Endomorphisms of graphs. I: The monoid of strong endomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    [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.
    0 references
    0 references
    generalized lexicographic product
    0 references
    monoid of strong endomorphisms
    0 references
    wreath product of a group
    0 references
    regular monoid
    0 references