The structure of a graph inverse semigroup

From MaRDI portal




Abstract: Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the non-Rees congruences on G(E), show that the quotient of G(E) by any Rees congruence is another graph inverse semigroup, and classify the G(E) that have only Rees congruences. We also find the minimum possible degree of a faithful representation by partial transformations of any countable G(E), and we show that a homomorphism of directed graphs can be extended to a homomorphism (that preserves zero) of the corresponding graph inverse semigroups if and only if it is injective.




Cited in
(26)


Describes a project that uses

Uses Software





This page was built for publication: The structure of a graph inverse semigroup

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