Name
Abstract | ||
|---|---|---|
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 1.(i)|H is an induced subgraph of G, 2.(ii)|H is stable by every f @e End G, 3.(iii)|every f @e End G is uniquely determined by its restriction to H, 4.(iv)|the restriction of End G to H is precisely B. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0012-365X(80)90113-2 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Subgroup,Induced subgraph,Semigroup,Mathematics,Endomorphism | Journal | 30 |
Issue | ISSN | Citations |
2 | Discrete Mathematics | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Foldes | 1 | 20 | 14.43 |
| G. Sabidussi | 2 | 8 | 2.32 |