On End-regular graphs

A monoid which is von Neumann regular is called orthodox if its idempotents form a submonoid. A graph is called (End)-regular or (End)-orthodox if its monoid of graph endomorphisms is a (von Neumann) regular or orthodox monoid. Here graph endomorphisms are mappings of the vertex set which preserve edges. The author proves, for example, the following results. The monoid \(\text{End} X [\text{End} Y]\) is regular if the following conditions are satisfied: (1) \(\text{End} X\) and \(\text{End} Y\) are regular, and (2) \(\text{End} X\) or \(\text{End} Y\) is a group. The monoid \(\text{End} X [\text{End} Y]\) is orthodox if and only if the following conditions are satisfied: (1) \(\text{End} X\) and \(\text{End} Y\) are orthodox, and (2) \(\text{End} X\) is a group, or \(\text{End} Y\) is a group and \(\text{End} X\) is left inverse. Here \(\text{End} X [\text{End} Y]\) denotes the wreath product of the monoids \(\text{End} X\) and \(\text{End} Y\) through the left \(\text{End} X\)-act \(X\).

Recommendations

Cites work

Cited in

(31)

This page was built for publication: On End-regular graphs

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