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

摘要

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 lexicographic products of bipartite graphs.