The endomorphisms monoids of graphs of order n with a minimum degree n − 3

We characterize the endomorphism monoids, End(G), of the generalized graphs G of order n with a minimum degree n − 3. Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of G are given

The Endomorphism Monoids of (n − 3)-regular Graphs of Order n

This paper is motivated by the result of W. Li, he presents an infinite family of graphs - complements of cycles - which possess a regular monoid. We show that these regular monoids are completely regular. Furthermore, we characterize the regular, orthodox and completely regular endomorphisms of the join of complements of cycles, i.e. (n−3)-regular graph of order n

Endomorphisms of Cayley digraphs of rectangular groups

Let Cay(S,A) denote the Cayley digraph of the semigroup S with respect to the set A, where A is any subset of S. The function f : Cay(S,A) → Cay(S,A) is called an endomorphism of Cay(S,A) if for each (x, y) ∈ E(Cay(S,A)) implies (f(x), f(y)) ∈ E(Cay(S,A)) as well, where E(Cay(S,A)) is an arc set of Cay(S,A). We characterize the endomorphisms of Cayley digraphs of rectangular groups G × L × R, where the connection sets are in the form of A = K × P × T