Endomorphisms of graphs. II: Various unretractive graphs (Q1824633)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4118399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Endomorphisms of graphs. II: Various unretractive graphs |
scientific article; zbMATH DE number 4118399 |
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
0.8542899489402771
0 references
0.8349975943565369
0 references
0.8306232690811157
0 references
