Graphs with a regular endomorphism monoid

DOI10.1007/BF01207836zbMath0855.05090MaRDI QIDQ1924914

Elke Wilkeit

Publication date: 26 January 1997

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

zbMATH Keywords

bipartite graphsreflexive graphsregular endomorphism monoid

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (23)

The join of split graphs whose completely regular endomorphisms form a monoid ⋮ Unicyclic graphs with regular endomorphism monoids ⋮ End-regular and End-orthodox generalized lexicographic products of bipartite graphs ⋮ End-regular and End-orthodox lexicographic products of bipartite graphs ⋮ An approach to construct an end-regular graph ⋮ Semigroups of strong endomorphisms of infinite graphs and hypergraphs. ⋮ The endomorphism monoid of \(\overline{P_n}\). ⋮ Graphs whose endomorphism monoids are regular ⋮ On endomorphism-regularity of zero-divisor graphs ⋮ 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 ⋮ Unnamed Item ⋮ Trees whose regular endomorphisms form a monoid ⋮ Partial automorphisms and injective partial endomorphisms of a finite undirected path ⋮ Naturally ordered strong endomorphisms on graphs ⋮ End-regularity of generalized bicycle graph ⋮ Ranks of monoids of endomorphisms of a finite undirected path ⋮ End-regularity of zero-divisor graphs of group rings ⋮ Generalized symmetry of graphs - a survey ⋮ More on linear and metric tree maps ⋮ Generalized symmetry of graphs

Cites Work

• Unnamed Item
• Dismantling absolute retracts of reflexive graphs
• The retracts of Hamming graphs
• Absolute retracts of bipartite graphs
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Symmetric relations (undirected graphs) with given semigroups
• Retracts of hypercubes
• Unretractive and S-unretractive joins and lexicographic products of graphs
• Fixed-edge theorem for graphs with loops

This page was built for publication: Graphs with a regular endomorphism monoid