Concrete characterization of partial endomorphism semigroups of graphs

From MaRDI portal





Algebraic and elementary properties of partial endomorphism semigroups of graphs were studied by several authors. For these semigroups it is interesting to study the concrete characterization problem [\textit{B. Jónsson}, Topics in universal algebra (1972; Zbl 0225.08001)]: under which conditions is a partial transformation semigroup E equal to the partial endomorphism semigroup E(G) of some graph G? In the present paper we investigate this problem. The necessary and sufficient conditions for a partial transformation semigroup E to be equal to the partial endomorphism semigroup E(G) of some graph G will be obtained in Theorem 2. We construct all kinds of such graphs in Theorem 1. At the end of the paper we apply our results to describe (in Theorem 3) graphs with equal partial endomorphisms and to investigate (in Theorem 4) the question: how are graphs determined by their partial endomorphism semigroups? Numerous other applications of Theorems 1 and 2 are briefly stated in [the author, Endmorphism semigroup of graphs, XVI-th AU-Union Conf. Gen. Algebra, Vol. 2, 92-93 (1981)].











This page was built for publication: Concrete characterization of partial endomorphism semigroups of graphs

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