AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem on automorphisms, we are considering endomorphisms of a graph in their relationship to endomorphisms of its derivative graph. Particularly, we characterize in this connection the graphs with the best endomorphisms
In this paper introduce the homomorphism, isomorphism, weak isomorphism and co-weak isomorphism of N...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractFor a homomorphism between directed graphs G1 and G2, its extension is the mapping of the se...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
AbstractWe define a new type of graph of a group with reference to the descending endomorphisms of t...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
http://deepblue.lib.umich.edu/bitstream/2027.42/5440/5/bac4075.0001.001.pdfhttp://deepblue.lib.umich...
Several results on the action of graph automorphisms on ends and fibers are generalized for the case...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
AbstractWe study the class of graphs with the property that every homomorphic image is a subgraph. O...
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
The concept of strong neutrosophic graph is developed with example and some of their properties are ...
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed fo...
In this paper introduce the homomorphism, isomorphism, weak isomorphism and co-weak isomorphism of N...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractFor a homomorphism between directed graphs G1 and G2, its extension is the mapping of the se...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
AbstractWe define a new type of graph of a group with reference to the descending endomorphisms of t...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
http://deepblue.lib.umich.edu/bitstream/2027.42/5440/5/bac4075.0001.001.pdfhttp://deepblue.lib.umich...
Several results on the action of graph automorphisms on ends and fibers are generalized for the case...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
AbstractWe study the class of graphs with the property that every homomorphic image is a subgraph. O...
AbstractIn this paper, we first give a characterization of a completely regular strong endomorphism ...
An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ ...
The concept of strong neutrosophic graph is developed with example and some of their properties are ...
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed fo...
In this paper introduce the homomorphism, isomorphism, weak isomorphism and co-weak isomorphism of N...
AbstractA graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense,...
AbstractFor a homomorphism between directed graphs G1 and G2, its extension is the mapping of the se...
DOI
Add to ORKG