Endomorphisms of graphs. I: The monoid of strong endomorphisms

DOI10.1007/BF01237575zbMath0683.05026MaRDI QIDQ1824632

Martin Nieporte, Ulrich Knauer

Publication date: 1989

Published in: Archiv der Mathematik (Search for Journal in Brave)

zbMATH Keywords

regular monoidgeneralized lexicographic productmonoid of strong endomorphismswreath product of a group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Groupoids (i.e. small categories in which all morphisms are isomorphisms) (20L05)

Related Items

The monoid of strong endomorphisms of a graph ⋮ Unicyclic graphs with regular endomorphism monoids ⋮ Semigroup theory of symmetry ⋮ A regular endomorphism of a graph and its inverses ⋮ On the endomorphism monoids of Clifford semigroups ⋮ Endotypes of partial equivalence relations ⋮ Graphs with a regular endomorphism monoid ⋮ An approach to construct an end-regular graph ⋮ Semigroups of strong endomorphisms of infinite graphs and hypergraphs. ⋮ Endomorphism semigroups of some free products. ⋮ Inverses and pseudo-inverses of a strong endomorphism of a graph ⋮ Unnamed Item ⋮ Graphs whose endomorphism monoids are regular ⋮ On unretractive graphs ⋮ Endomorphism spectra of graphs ⋮ Green's relations on the strong endomorphism monoid of a graph ⋮ On unretractive graphs ⋮ Endomorphism-regularity of split graphs ⋮ On wreathed lexicographic products of graphs ⋮ Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs ⋮ Divisible, torsion-free, and act regular generalized act wreath products ⋮ Naturally ordered strong endomorphisms on graphs ⋮ The endotopism semigroups of a partial equivalence relation ⋮ End-regularity of zero-divisor graphs of group rings ⋮ Endomorphisms of graphs. II: Various unretractive graphs ⋮ Inverse monoids of graphs ⋮ Unnamed Item ⋮ Green's relations in some categories of strong graph homomorphisms ⋮ Generalized symmetry of graphs - a survey ⋮ Unnamed Item ⋮ Various inverses of a strong endomorphism of a graph ⋮ Generalized symmetry of graphs ⋮ Correspondences of the semigroup of endomorphisms of an equivalence relation.

Cites Work

• Wreath products of ordered semigroups. I: General properties, idempotent and regular Cartesian isotone wreath products
• The composition of graphs
• Graph derivatives
• On some strongly rigid families of graphs and the full embeddings they induce
• Symmetric relations (undirected graphs) with given semigroups
• Unretractive and S-unretractive joins and lexicographic products of graphs
• On Rigid Undirected Graphs
• The group of an X-join of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item