In this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n
vertices, is explored explicitly. It is shown that End (Pn¯) is orthodox. Some enumerative …

In this paper we consider endomorphisms of an undirected cycle graph from Semigroup
Theory perspective. Our main aim is to present a process to determine sets of generators …

In this paper, we give several approaches to construct new End-regular (-orthodox) graphs
by means of the join and the lexicographic product of two graphs with certain conditions. In …

There are six different classes of endomorphisms for a graph. The set of these
endomorphisms always form a chain under set inclusions. The endomorphism type of a …

Аннотация В работе описываются два точных представления моноида сильных
эндоморфизмов произвольного конечного n-однородного гиперграфа. Доказано, что …

In this paper we consider the monoids of all partial endomorphisms, of all partial weak
endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms …

The Endomorphism Monoid of N-Prism 1 Introduction and preliminaries Page 1 International
Mathematical Forum, Vol. 6, 2011, no. 50, 2461 - 2471 The Endomorphism Monoid of N-Prism …

In this paper, two exact representations of the strong endomorphism monoid of an arbitrary
finite n-uniform hypergraph are described. It is proved that the strong endomorphism monoid …

This paper is motivated by the result of W. Li, that presents an infinite family of graphs-
complements of cycles—which possess a regular monoid. We show that these regular …

A retraction f of a graph G is an edge-preserving mapping of G with f (v)= v for all v∈ V (H),
where H is the subgraph induced by the range of f. A graph G is called End-orthodox (End …