Total edge irregularity strength of (n,t)-kite graph
Tri Winarsih, Diari Indriati · Journal of Physics Conference Series · 2018
Let G ( V, E ) be a simple, connected, and undirected graph with vertex set V and edge set E . A total k -labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, ..., k }. An edge irregular total k -labeling of a graph G is a labeling of vertices and edges of G in such a way that for any different edges e and f , weights wt ( e ) and wt ( f ) are distinct. The weight wt ( e ) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e . The total edge irregularity strength of G , tes ( G ), is defined as the minimum k for which a graph G has an edge irregular total k -labeling. An ( n, t )-kite graph consist of a cycle of length n with a t -edge path (the tail) attached to one vertex of a cycle. In this paper, we investigate the total edge irregularity strength of the ( n, t )-kite graph, with n > 3 and t > 1. We obtain the total edge irregularity strength of the ( n, t )-kite graph is tes (( n, t )- kite ) = .