Graphs whose endomorphism monoids are regular

• DOI: 10.1016/j.disc.2007.07.094
• Publication Date: 2007-09-05T07:23:07Z
• Authors: Hailong Hou; Yanfeng Luo
• Keywords: Join (topology); Lexicographical order; Graph product

AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by means of the join and the lexicographic product of two graphs with certain conditions. In particular, the join of two connected bipartite graphs with a regular (orthodox) endomorphism monoid is explicitly described.