On semigroups of graph endomorphisms
✍
S. Foldes; G. Sabidussi
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 358 KB
It is shown that given a finite or infinite graph H and a subsemigroup B of its endomorphism semigroup End H, there exists a graph G such that (i) H is an induced subgraph of G, (ii) H is stable by every fe End 6. (iii) every f~ End G is uniquely determined by its restriction to H, (iv) the restric