AbstractBy traversing square lattices, the cardinality of the set of congruence classes induced by the graph endomorphisms of undirected paths is determined. Enhancing this idea, formulas for the cardinality of the set of endomorphisms and the set of congruence classes of undirected cycles are developed
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contr...
It is shown that a variety V has distributive congruence lattices if and only if the intersection of...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
summary:Characterization of congruence lattices of finite chains with either one or two endomorphism...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A basic tool in universal algebra is that of a congruence. It has been shown that congruences can be...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
The first of two results is a 1-1-correspondence between isomorphism classes of finite-dimensional v...
summary:A concept of congruence preserving upper and lower bounds in a poset $P$ is introduced. If $...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contr...
It is shown that a variety V has distributive congruence lattices if and only if the intersection of...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
summary:Characterization of congruence lattices of finite chains with either one or two endomorphism...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A basic tool in universal algebra is that of a congruence. It has been shown that congruences can be...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
The first of two results is a 1-1-correspondence between isomorphism classes of finite-dimensional v...
summary:A concept of congruence preserving upper and lower bounds in a poset $P$ is introduced. If $...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contr...
It is shown that a variety V has distributive congruence lattices if and only if the intersection of...
DOI
Add to ORKG