AbstractA real-valued function ƒ defined on the set of all graphs, G, such that ƒ(G×H)=ƒ(G)ƒ(H) for all G, H ϵ G is called multiplicative; and ƒ(G)⩽ƒ(H) whenever G is a subgraph of H is called increasing. The classification of multiplicative increasing graph functions is still open. Up to now, there are a lot of known multiplicative increasing graph functions. In this paper, we introduce a new class of multiplicative increasing graph functions, namely, ϕG, S for all G ϵ G and ∅≠S⊆V(G), defined to be the number of all possible homomorphic images of S for the homomorphism from G into H. Several properties of additive multiplicative increasing graph functions are also discussed in this paper
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, fi...
http://deepblue.lib.umich.edu/bitstream/2027.42/5440/5/bac4075.0001.001.pdfhttp://deepblue.lib.umich...
Homomorfismos de grafos são funções do conjunto de vértices de um grafo no conjunto de vértices de o...
AbstractA real-valued function ƒ defined on the set of all graphs, G, such that ƒ(G×H)=ƒ(G)ƒ(H) for ...
AbstractFor any graph H, the function hH, defined by setting hH(G) equal to the number of homomorphi...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. M...
AbstractA homomorphism of a digraph to another digraph is an edge preserving vertex mapping. A digra...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
AbstractFor any two graphs F and G, let hom(F,G) denote the number of homomorphisms F→G, that is, ad...
AbstractIt is known that if f is a multiplicative increasing function on N, then either f(n)=0 for a...
AbstractFor a graph G whose vertices are v1,v2,…,vm and where E is the set of edges, we define a fun...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
Abstract. We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target g...
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, fi...
http://deepblue.lib.umich.edu/bitstream/2027.42/5440/5/bac4075.0001.001.pdfhttp://deepblue.lib.umich...
Homomorfismos de grafos são funções do conjunto de vértices de um grafo no conjunto de vértices de o...
AbstractA real-valued function ƒ defined on the set of all graphs, G, such that ƒ(G×H)=ƒ(G)ƒ(H) for ...
AbstractFor any graph H, the function hH, defined by setting hH(G) equal to the number of homomorphi...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. M...
AbstractA homomorphism of a digraph to another digraph is an edge preserving vertex mapping. A digra...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
AbstractFor any two graphs F and G, let hom(F,G) denote the number of homomorphisms F→G, that is, ad...
AbstractIt is known that if f is a multiplicative increasing function on N, then either f(n)=0 for a...
AbstractFor a graph G whose vertices are v1,v2,…,vm and where E is the set of edges, we define a fun...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
Abstract. We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target g...
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, fi...
http://deepblue.lib.umich.edu/bitstream/2027.42/5440/5/bac4075.0001.001.pdfhttp://deepblue.lib.umich...
Homomorfismos de grafos são funções do conjunto de vértices de um grafo no conjunto de vértices de o...