scientific article; zbMATH DE number 1150069
Let \(G\) be a finite undirected graph without loops and multiple edges, \(V(G)\) denotes its vertex set. An endomorphism \(f\) of \(G\), i.e. an edge preserving map, is called a strong endomorphism if \(\{f(a),f(b)\}\in E(G)\) implies that \(\{a,b\}\in E(G)\) for \(a,b\in V(G)\). The monoid of strong endomorphisms of \(G\) is denoted by \(\text{SEnd}(G)\). For \(f,g\in\text{SEnd}(G)\) with \(f{\mathcal L}g\), where \(\mathcal L\) denotes Green's \(\mathcal L\)-relation, the author describes all \(u\in\text{SEnd}(G)\) such that \(uf=g\), i.e. all left inverses of \(f\) with respect to \(g\). Analogously, with a somewhat easier description the author proves the right analogue: for \(f,g\in\text{SEnd}(G)\) with \(f{\mathcal R}g\) the following two statements are equivalent: (1) \(u\in\text{SEnd}(G)\) such that \(fu=g\); (2) \(u\) is a mapping from \(V(G)\) to itself such that \(u(x)\in f^{-1}(g(x))\) for any \(x\in V(G)\).
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 Q4388280)
