The monoid of strong endomorphisms of a graph

DOI10.1007/BF02573480MaRDI QIDQ1333176zbMATH OpenFDO

Authors Weimin Li

Publication date 16 March 1995

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/135343

zbMATH Keywords

idempotentsinversesmonoid of strong endomorphismsundirected graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subalgebras, congruence relations (08A30) Mappings of semigroups (20M15) Regular semigroups (20M17) Semigroups of transformations, relations, partitions, etc. (20M20)

Review text

The author investigates strong endomorphisms of finite undirected graphs without loops and multiple edges. A strong endomorphism is a mapping on the vertex set which preserves and reflects edges (i.e. the preimage of an edge is an edge). The author studies Green's \(\mathcal R\) and \(\mathcal L\) classes of the monoids of strong endomorphisms. He describes idempotents in these classes and all inverses to any strong endomorphism taking into account that the monoid of strong endomorphisms is always regular, i.e. inverses in this sense do exist. He also gives formulas for the number of idempotents and inverses.

Recommendations

• Green's relations on the strong endomorphism monoid of a graph
• Inverses and pseudo-inverses of a strong endomorphism of a graph
• scientific article; zbMATH DE number 1150069

Cites work

• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Green's relations on the strong endomorphism monoid of a graph
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the structure of semigroups
• Regular D -Classes in Semigroups

Cited in

(23)

• Green's relations in some categories of strong graph homomorphisms
• Inverse monoids of graphs
• Idempotent endomorphisms of a graph
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Graphs whose strong endomorphism monoids are regular
• Naturally ordered strong endomorphisms on graphs
• Weak endomorphism monoid of a graph
• Path strong and cycle strong graph endomorphisms and applications
• scientific article; zbMATH DE number 1382456 (Why is no real title available?)
• Semigroups of strong endomorphisms of infinite graphs and hypergraphs.
• scientific article; zbMATH DE number 1264343 (Why is no real title available?)
• scientific article; zbMATH DE number 1296777 (Why is no real title available?)
• scientific article; zbMATH DE number 1300191 (Why is no real title available?)
• scientific article; zbMATH DE number 700008 (Why is no real title available?)
• scientific article; zbMATH DE number 1150069 (Why is no real title available?)
• scientific article; zbMATH DE number 1159832 (Why is no real title available?)
• scientific article; zbMATH DE number 1789777 (Why is no real title available?)
• Inverses and pseudo-inverses of a strong endomorphism of a graph
• THE JOIN OF SPLIT GRAPHS WHOSE QUASI-STRONG ENDOMORPHISMS FORM A MONOID
• scientific article; zbMATH DE number 5274497 (Why is no real title available?)
• On partial endomorphisms of a star graph
• Green's relations on the strong endomorphism monoid of a graph
• A strong geometric hyperbolicity property for directed graphs and monoids.

This page was built for publication: The monoid of strong endomorphisms of a graph

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