A total k-labeling is a function fe from the edge set to {1, 2, . , ke} and fv vertex {0, 4, 2kv}, where k = max{ke, 2kv}. distance irregular reflexive of graph G k-labeling, if for every two different vertices u 0 G, w(u) 6= w(u ), Σui∈N(u)fv(ui) + Σuv∈E(G)fe(uv). The minimum which has k-labelling called strength denoted by Dref (G). In this paper, we determine exact value some connected graph...

It is not possible to determine the total vertex of irregular strength all graphs. This study aims ascertain irregularity in prismatic graph amalgamation for n>=4. Determination done by ascertaining largest lower limit and smallest upper limit. The analyzed based on properties other supporting theorems, while labeling vertices edges graph. Based results this study, obtained, namely (4(P2,n))...

Let G be a simple graph of n order. An edge labeling such that the weights all vertex are different and elements set modulo n, called modular irregular labeling. The irregularity strength is minimum positive integer k have If none, then we infinity. In this article, determine complete graphs.

We define a total k-labeling φ of graph G as combination an edge labeling φe:E(G)→{1,2,…,ke} and vertex φv:V(G)→{0,2,…,2kv}, such that φ(x)=φv(x) if x∈V(G) φ(x)=φe(x) x∈E(G), where k= max {ke,2kv}. The is called irregular reflexive every two different edges has distinct weights, the weight defined summation label itself its labels. Thus, smallest value k for which strength G. In this paper, we ...

I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...

For a simple graph G, a vertex labeling φ : V (G) → {1, 2, · · · , k} is called k-labeling. The weight of an edge xy in G, denoted by wπ(xy), is the sum of the labels of end vertices x and y, i.e. wφ(xy) = φ(x) + φ(y). A vertex k-labeling is defined to be an edge irregular k-labeling of the graph G if for every two different edges e and f , there is wφ(e) 6= wφ(f). The minimum k for which the g...

As a standard notation, assume that G = G(V,E) is a finite, simple and undirected graph with p vertices and q edges. A labeling of a graph is any mapping that sends some set of graph elements to a set of numbers (usually positive integers). If the domain is the vertex-set or the edge-set, the labelings are called respectively vertex-labelings or edge-labelings. If the domain is V ∪E then we cal...

Let G be a graph with p vertices and q edges an injective function, where k is positive integer. If the induced edge labeling defined by for each bijection, then f called odd Fibonacci irregular of G. A which admits graph. The irregularity strength ofes(G) minimum labeling. In this paper, some subdivision graphs obtained from vertex identification determined.