End-regular and End-orthodox generalized lexicographic products of bipartite graphs

Abstract

A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.

Keywords

• endomorphism
• monoid
• generalized lexicographic product
• bipartite graph
• 05c25