Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms a regular monoid. In this paper, we discuss the End-regularity of Helm graphs and our generalization. We also prove that the generalized Helm graph is End-orthodox if and only if it is End-regular. Moreover, we investigate the End-regularity of the join of two generalized Helm graphs
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
AbstractA retraction f of a graph G is an edge-preserving mapping of G with f(v)=v for all v∈V(H), w...
In this paper, we characterise the quasi-strong endomorphisms of the join of split graphs. We give ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
AbstractA retraction f of a graph G is an edge-preserving mapping of G with f(v)=v for all v∈V(H), w...
In this paper, we characterise the quasi-strong endomorphisms of the join of split graphs. We give ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...