Graphs whose strong endomorphism monoids are regular (Q1969087): Difference between revisions

The main result is: Let \(X\) be a graph. \(U\) be its canonical strong factor graph. Then the following statements are equivalent: (1) \(S\operatorname {End}X\) is a regular monoid. (2) Any strong range subgraph of \(X\) is a strong retract. (3) \(U\) is \(S\)-unretractive. (4) \(U\) contains no proper subgraph which is isomorphic to \(U\). Graphs are undirected, without multiple edges, but possibly infinite. For a strong endomorphism \(f\) of \(X\) the range of the mapping \(f\) is denoted by \(\operatorname {ran}(f)\), the subgraph induced by \(\operatorname {ran}(f)\) is denoted by \(R(f)\) and called a strong range subgraph. If \(f\) is an idempotent strong endomorphism of \(X\), then \(R(f)\) is called a strong retract.