Endomorphisms of graphs. II: Various unretractive graphs

From MaRDI portal





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.











This page was built for publication: Endomorphisms of graphs. II: Various unretractive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824633)