E. Nurdini, I. Rosyida, Mulyono
Given a graph G(V, E) with a non-empty set of vertices V and a setof edges E. A total labelling f: V ∪ E → {1,2,.., k} is called an edge irregular total labeling if the weight of every edge is distinct. The weight of anedgee, under the total labeling f, is the sum of label of edgee and all labels of vertices that are incident to e. In other words, wt(xy) = f(xy) + f(x) + f(y). The total edge irregularity strength of G, denoted by tes(G) is the minimum k used to label graph G with the edge irregular total labeling. A tadpole chain graph of length r, denoted as Tr (6, n), is a chain graph that consists of tadpole graph T (6, n) on each block. In this paper, we get and construct an algorithm to find it. © Published under licence by IOP Publishing Ltd.
Mathematics Department, Universitas Negeri Semarang, Semarang, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock