
AbstractA 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.
monoid, 05c25, bipartite graph, QA1-939, endomorphism, Mathematics, Graphs and abstract algebra (groups, rings, fields, etc.), generalized lexicographic product
monoid, 05c25, bipartite graph, QA1-939, endomorphism, Mathematics, Graphs and abstract algebra (groups, rings, fields, etc.), generalized lexicographic product
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
