Endomorphisms of graphs. II: Various unretractive graphs
type: Item
instance of: scholarly article
title: Endomorphisms of graphs. II: Various unretractive graphs
zbMATH Open document ID: 0683.05027
DOI: 10.1007/BF01189142
published in: Archiv der Mathematik
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 20M20
zbMATH DE Number: 4118399
zbMATH Keywords: unretractive graphs
zbMATH Keywords: endomorphism monoids
zbMATH Keywords: strong endomorphisms
zbMATH Keywords: automorphisms
author: Ulrich Knauer
reviewed by: Ulrich Knauer
MaRDI profile type: Publication
cites work: On Rigid Undirected Graphs
cites work: Q5554159
cites work: Unretractive and S-unretractive joins and lexicographic products of graphs
cites work: Endomorphisms of graphs. I: The monoid of strong endomorphisms
full work available at URL: https://doi.org/10.1007/bf01189142
OpenAlex ID: W1963488053
description: scientific article; zbMATH DE number 4118399