Endomorphisms of graphs. II: Various unretractive graphs (Q1824633): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On Rigid Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unretractive and S-unretractive joins and lexicographic products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms of graphs. I: The monoid of strong endomorphisms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01189142 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963488053 / rank
 
Normal rank

Latest revision as of 10:10, 30 July 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
    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
    0 references
    unretractive graphs
    0 references
    endomorphism monoids
    0 references
    strong endomorphisms
    0 references
    automorphisms
    0 references
    0 references
    0 references
    0 references