Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid

Rui Cu, Hailong Hou
2020 Mathematics  
In this paper, completely regular endomorphisms of unicyclic graphs are explored. Let G be a unicyclic graph and let c E n d ( G ) be the set of all completely regular endomorphisms of G. The necessary and sufficient conditions under which c E n d ( G ) forms a monoid are given. It is shown that c E n d ( G ) forms a submonoid of E n d ( G ) if and only if G is an odd cycle or G = G ( n , m ) for some odd n ≥ 3 and integer m ≥ 1 .
doi:10.3390/math8020240 fatcat:llvummkxyzedbm46mmmywqdlxu