Graphs whose strong endomorphism monoids are regular

DOI10.1007/S000130050418MaRDI QIDQ1969087zbMATH OpenOpenAlexFDO

Publication date 15 August 2000

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000130050418

graph regular monoid strong endomorphism

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semigroups of transformations, relations, partitions, etc. (20M20)

Review text

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.

Recommendations

Cited in

(15)

This page was built for publication: Graphs whose strong endomorphism monoids are regular

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969087)