科研之友
微信
新浪微博
Facebook
分享链接
摘要
A reflexive digraph is a pair (X, rho), where X is an arbitrary set and rho is a reflexive binary relation on X. Let End (X, rho) be the semigroup of endomorphisms of (X, rho). We determine the group of automorphisms of End(X, rho) for: digraphs containing an edge not contained in a cycle, digraphs consisting of arbitrary unions of cycles such that cycles of length >= 2 are pairwise disjoint, and some circulant digraphs.
- 出版日期2010-7
