End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Rui Gu, Hailong Hou · Open Mathematics · 2016
Abstract A graphXis said to be End-regular (End-orthodox) if its endomorphism monoidEnd(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.