AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense, that is, for any f in End X there exists g in End X with fgf = f. End-regular bipartite graphs were characterized in [1]. In this paper, End-regular graphs are obtained through the lexicographic product of End-regular graphs, and strong End-regular graphs (End-orthodox graphs) are investigated
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X...
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 ...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
AbstractIt is shown that given a finite or infinite graph H and a subsemigroup B of its endomorphism...
AbstractA retraction f of a graph G is an edge-preserving mapping of G with f(v)=v for all v∈V(H), w...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
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
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X...
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 ...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
AbstractIt is shown that given a finite or infinite graph H and a subsemigroup B of its endomorphism...
AbstractA retraction f of a graph G is an edge-preserving mapping of G with f(v)=v for all v∈V(H), w...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
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
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
DOI
Add to ORKG