Green's relations on the strong endomorphism monoid of a graph.
W. Li (1993)
Semigroup forum
Similarity:
Displaying similar documents to “The monoid of strong endomorphisms of a graph.”
Green's relations on the strong endomorphism monoid of a graph.
The syntactic monoid of a hypercode.
G. Thierrin (1974)
Semigroup forum
Similarity:
Graph Monoids.
F.W. Roush, K.H. Kim, L.G. Makar-Limanov (1982)
Semigroup forum
Similarity:
Green's relations on the endomorphism monoid of a graph
Weimin Li (1995)
Mathematica Slovaca
Similarity:
A note on homomorphisms of a free monoid.
C.M. Reis (1978)
Semigroup forum
Similarity:
Note on compatible well orders on a free monoid.
Y. Kobayashi (1992)
Semigroup forum
Similarity:
Monoides pointes.
J. Sakarovitch (1979)
Semigroup forum
Similarity:
End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Rui Gu, Hailong Hou (2016)
Open Mathematics
Similarity:
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.
Some closure properties in monoids.
S. Schanuel, J. Isbell (1993)
Semigroup forum
Similarity: