Endomorphism spectra of graphs

DOI10.1016/0012-365X(92)90277-MzbMath0792.05135OpenAlexW2092319590MaRDI QIDQ686281

Michael Böttcher, Ulrich Knauer

Publication date: 14 October 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90277-m

zbMATH Keywords

endomorphismsgraph homomorphismsmonoidsendomorphism spectrumstrong endomorphismsstrong homomorphism

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Graph theory (05C99) Automorphisms and endomorphisms of algebraic structures (08A35)

Related Items (31)

Unicyclic graphs with regular endomorphism monoids ⋮ On the Endomorphism Monoid of K(n,3) ⋮ End-regular and End-orthodox generalized lexicographic products of bipartite graphs ⋮ Semigroup theory of symmetry ⋮ End-regular and End-orthodox lexicographic products of bipartite graphs ⋮ Split graphs whose half-strong endomorphisms form a monoid ⋮ The join of split graphs whose half-strong endomorphisms form a monoid ⋮ Endotypes of partial equivalence relations ⋮ An approach to construct an end-regular graph ⋮ Semigroups of strong endomorphisms of infinite graphs and hypergraphs. ⋮ On regularity of semigroups of maps that preserve a binary relation ⋮ Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57] ⋮ The endomorphism type of certain bipartite graphs and a characterization of projective planes ⋮ Unnamed Item ⋮ The endomorphism monoid of \(\overline{P_n}\). ⋮ Transformation semigroups preserving a binary relation. ⋮ On endomorphism-regularity of zero-divisor graphs ⋮ The Join of Split Graphs Whose Regular Endomorphisms Form a Monoid ⋮ On unretractive graphs ⋮ On unretractive graphs ⋮ Endomorphism-regularity of split graphs ⋮ On wreathed lexicographic products of graphs ⋮ THE JOIN OF SPLIT GRAPHS WHOSE QUASI-STRONG ENDOMORPHISMS FORM A MONOID ⋮ Trees whose regular endomorphisms form a monoid ⋮ Naturally ordered strong endomorphisms on graphs ⋮ End-regularity of zero-divisor graphs of group rings ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Generalized symmetry of graphs - a survey ⋮ Unnamed Item ⋮ Generalized symmetry of graphs ⋮ Correspondences of the semigroup of endomorphisms of an equivalence relation.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retract rigid Cartesian products of graphs
• The monoid of strict endomorphisms of wreath products
• Graph derivatives
• On some strongly rigid families of graphs and the full embeddings they induce
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Symmetric relations (undirected graphs) with given semigroups
• To the graph theory
• Unretractive and S-unretractive joins and lexicographic products of graphs
• On Rigid Undirected Graphs

This page was built for publication: Endomorphism spectra of graphs