On End-regular graphs
✍
Suohai Fan
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 390 KB
A graph X is End-regular if its endomorphism monoid End X is regular in the sernigroup sense, that is, for any fin End X there exists g in End X with fgf=f. End-regular bipartite graphs were characterized in [l]. In this paper, End-regular graphs are obtained through the lexicographic product of End