Add to ORKGIn this paper, we characterise the quasi-strong endomorphisms of the join of split graphs. We give the conditions under which the quasi-strong endomorphisms of the join of split graphs form a monoid. DOI: 10.1017/S000497271400046
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
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 ...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
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,...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractIn this paper, split graphs with a regular endomorphism monoid are characterized explicitly
AbstractThis paper is motivated by an open question: which graphs have a regular (endomorphism) mono...
AbstractIn this paper, we give several approaches to construct new End-regular (-orthodox) graphs by...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
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 ...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
Let $G$ be a graph. Then $G$ is said to be End-regular if the set of all endomorphisms of $G$ forms ...
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,...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...