|
This article is cited in 6 scientific papers (total in 6 papers)
Endomorphisms of functional graphs
V. A. Kolmykov
Abstract:
A functional graph is a digraph describing the action of a function on a set. The endomorphisms of such graphs are of interest in group theory: the centraliser of an element of the semigroup of all mappings of a set into itself coincides with the set of all endomorphisms of a digraph corresponding to this element.
In this study, the functional graphs with a countable set of vertices are considered. We introduce the notion of lineals and calculate the cardinality of the set of endomorphisms of functional graphs which are not lineals.
Received: 30.11.2004
Citation:
V. A. Kolmykov, “Endomorphisms of functional graphs”, Diskr. Mat., 18:3 (2006), 115–119; Discrete Math. Appl., 16:4 (2006), 423–427
Linking options:
https://www.mathnet.ru/eng/dm64https://doi.org/10.4213/dm64 https://www.mathnet.ru/eng/dm/v18/i3/p115
|
Statistics & downloads: |
Abstract page: | 785 | Full-text PDF : | 281 | References: | 79 | First page: | 4 |
|