scientific article; zbMATH DE number 1471886

Publication date 11 December 2000

\(P\)-regular endomorphism monoid lexicographic product

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

Review text

A regular monoid \(S\) is called \(P\)-regular if there exists a subset \(P\) of the idempotent set \(I(S)\) such that the following conditions are satisfied: (C1) \(P^2 \subseteq I(S)\). (C2) \(qPq \subseteq P\) for \(q\in P\). (C3) For any \(a\in S\), there exists \(a^+ \in V(a)\) such that \(aP^1a^+\subseteq P\) and \(a^+ P^1a\subseteq P\). The set \(P\) is called the characteristic set. Here \(V(a)\) is the set of all inverses of the element \(a\). The author proves: (1) Let \(X\) be a bipartite graph, and \(\text{End } X\) its endomorphism monoid. Then \(\text{End } X\) is \(P\)-regular if and only if \(X\) is one of the following graphs: \(K_1, K_2, K_{1,2}, P_3, C_4, 2K_1\) and \(K_1\cup K_2\). (2) For a graph \(X\) the following statements are equivalent: (a) \(\text{End X}\) is orthodox. (b) \(\text{End X}\) is \(P\)-regular. (c) \(X\) is one of the following graphs: \(K_1, K_2, K_{1,2}, P_3, C_4, 2K_1\) and \(K_1\cup K_2\). Moreover, for the lexicographic product \(X[Y]\) of two graphs \(X\) and \(Y\) he proves: (3) If \(\text{End } X[Y]\) is \(P\)-regular, then \(\text{End } X\) and \(\text{End } Y\) are \(P\)-regular. (4) If \(\text{End } X\) is a group and \(\text{End } Y\) is a \(P\)-regular monoid, then the wreath product \(\text{End } X [\text{End } Y]\) is a \(P\)-regular monoid. (5) Let \(X,Y\) be \(K_3\)-free connected graphs with \(g(X)\) or \(g(Y)\) odd. If \(\text{End } X\) is a group and \(\text{End } Y\) is \(P\)-regular, then the monoid \(\text{End }X [Y]\) is \(P\)-regular. (6) Let \(X\) be an unretractive graph with \(g(X) \geq 5\) and \(Y\) a bipartite graph with \(P\)-regular endomorphism monoid, then the graph \(X[Y]\) also has \(P\)-regular endomorphism monoid. (7) If \(Y\) is a bipartite graph with \(P\)-regular endomorphism monoid, then the graph \(C_{2n+1}[Y]\) also has \(P\)-regular endomorphism monoid for \(n\geq 2\).

Recommendations

Cited in

(9)

This page was built for publication:

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