End-regular and End-orthodox generalized 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 generalized lexicographic products of bipartite graphs.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2016-01-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2016-0021 |