In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].

For a graph G, let     max : is an edge cut of b G D D G  . For graphs G and H, a map     :V G V H   is a graph homomorphism if for each   e uv E G   ,       u v E H    . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with

A graph homomorphism is a vertex map which carries edges from a source graph to edgesin a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem(MAX H -COL) are edge-weighted graphs G and the objective is to find a subgraph of G that hasmaximal total edge weight, under the condition that the subgraph has a homomorphism to H ;note that for H = Kk th...

In this study, firstly, we interpret the level set, support, kernel for bipolar complex fuzzy (BCF) characteristic function, and BCF point. Then, subgroup, normal conjugate, normalizer cosets, abelian factor group. Furthermore, present associated examples theorems, prove these theorems. After that, image pre-image of subgroups under homomorphism related

Abstract We uncover a connection between the model-theoretic notion of superstability and that noetherian rings pure-semisimple rings. characterize via class left modules with embeddings. Theorem 0.1 For ring R following are equivalent. (1) is noetherian. (2) The R-modules embeddings superstable. (3) every ? ? | + ? 0 , there ? such has uniqueness limit models cardinality ?. (4) Every model in ...

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is ‘sub-logarithmic’, then the range of such a homomorphism is super-constant. Furthermore, some exam...