Green's relations on the strong endomorphism monoid of a graph (Q687641)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Green's relations on the strong endomorphism monoid of a graph |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Green's relations on the strong endomorphism monoid of a graph |
scientific article |
Statements
Green's relations on the strong endomorphism monoid of a graph (English)
0 references
20 December 1993
0 references
An endomorphism of a graph is called strong if in addition to preserving edges it also reflects edges. The author describes inside the graph Green's relations \(\mathcal L\), \(\mathcal R\), \(\mathcal H\) and \(\mathcal D\) for pairs of strong graph endomorphisms. As a consequence the author proves that the monoid of strong endomorphisms \(S\text{ End}(G)\) is regular. The methods are used to construct \(u \in S \text{ End}(G)\) with \(uf = g\) for \(f,g \in S \text{ End}(G)\) with \((f,g) \in {\mathcal L}\). All graphs are finite and undirected.
0 references
Green's relations
0 references
strong graph endomorphisms
0 references
monoid of strong endomorphisms
0 references