Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid
Keyword(s):
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 .
1976 ◽
Vol 19
(2)
◽
pp. 169-172
◽
2015 ◽
Vol 08
(04)
◽
pp. 1550075
1993 ◽
Vol 16
(4)
◽
pp. 817-818
1986 ◽
Vol 23
(04)
◽
pp. 851-858
◽
1991 ◽
Vol 11
(1)
◽
pp. 65-71
◽