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))...

An edge irregular total k-labeling φ : V (G)∪E(G) → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x) + φ(xy) + φ(y) and φ(x′) + φ(x′y′) + φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have ...

An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges with labels 1, 2, . . . , k such that the weights of any two different edges are distinct, where the weight of an edge is the sum of the label of the edge itself and the labels of its two end vertices. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregul...

Let ( , ) G V E be a simple graph. For a total labeling { } : 1,2,3,..., V E k ∂ ∪ → the weight of a vertex x is defined as ( ) ( ) ( ). xy E wt x x xy ∈ = ∂ + ∂ ∑ ∂ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y, ( ) ( ). wt x wt y ≠ . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularit...