Idempotent endomorphisms of a graph

DOI10.1016/S0012-365X(00)00105-9zbMATH Open0965.05055OpenAlexW2001064818MaRDI QIDQ1587623FDOQ1587623

Authors: Weimin Li 

Publication date: 23 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00105-9

Recommendations

• Graphs whose strong endomorphism monoids are regular
• (Strong) endomorphism monoids of graphs
• The monoid of strong endomorphisms of a graph
• scientific article; zbMATH DE number 679722
• scientific article; zbMATH DE number 1159832

zbMATH Keywords

idempotentasymmetricrigidcompletely regularunretractivestrong endomorphism

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (1)

• Almost all graphs are rigid-revisited

This page was built for publication: Idempotent endomorphisms of a graph

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