Endomorphisms of graphs. II: Various unretractive graphs (Q1824633): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Ulrich Knauer / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ulrich Knauer / rank | |||
Revision as of 02:41, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Endomorphisms of graphs. II: Various unretractive graphs |
scientific article |
Statements
Endomorphisms of graphs. II: Various unretractive graphs (English)
0 references
1990
0 references
In this part of the article [part I, cf. the review above] graphs are investigated, for which different endomorphism monoids coincide. Here endomorphisms, strong endomorphisms and automorphisms are considered. Coincidences are investigated for joins and lexicographic products of graphs. There are lists of graphs with the respective properties up to 8 vertices in two cases and up to 5 vertices in the remaining case.
0 references
unretractive graphs
0 references
endomorphism monoids
0 references
strong endomorphisms
0 references
automorphisms
0 references
