Endomorphism
Материал из WikiGrapp
Endomorphism --- эндоморфизм.
Given a graph (digraph) [math]\displaystyle{ G }[/math], endomorphism is a homomorphism of [math]\displaystyle{ G }[/math] into itself. The set of all endomorphisms of [math]\displaystyle{ G }[/math] with composition as multiplication, forms a semigroup denoted by [math]\displaystyle{ \mbox{End}(G) }[/math].