Add to ORKGA weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractWe prove different fixed subgraph properties for some infinite weakly modular graphs. In par...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undir...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
AbstractFor a given finite monoid M, let ςM(n) be the number of graphs on n vertices with endomorphi...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
In this paper, we study partial automorphisms and, more generally, injective partial endomorphisms o...
AbstractDenote by M(n) the smallest positive integer such that for every n-element monoid M there is...
AbstractBy traversing square lattices, the cardinality of the set of congruence classes induced by t...
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractWe prove different fixed subgraph properties for some infinite weakly modular graphs. In par...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undir...
In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undi...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
AbstractIn this paper, the endomorphism monoid of Pn¯, the complement of a path Pn with n vertices, ...
AbstractFor a given finite monoid M, let ςM(n) be the number of graphs on n vertices with endomorphi...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
In this paper, we study partial automorphisms and, more generally, injective partial endomorphisms o...
AbstractDenote by M(n) the smallest positive integer such that for every n-element monoid M there is...
AbstractBy traversing square lattices, the cardinality of the set of congruence classes induced by t...
AbstractThe paper studies the following question: Given a ring R, when does the zero-divisor graph Γ...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
AbstractWe prove different fixed subgraph properties for some infinite weakly modular graphs. In par...