E. Nurdini, I. Rosyida
Given a graph G(V, E) with a non-empty set V of vertices and a set E of edges. A total labelling λ: V ∪ E → { 1, 2,. . ., k} is called an edge irregular total labelling if the weight of every edge is distinct. The weight of an edge e, under the total labelling λ, is the sum of label of edge e and all labels of vertices that are incident to e. In other words, wt(xy) = λ(xy) + λ(x) + λ(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 labelling. In this paper, authors investigate the total edge irregularity strength of Dove tail graph with n pendant vertices , and the subdivision of which is denoted as . The results of this research are and . © Published under licence by IOP Publishing Ltd.
Department of Mathematics, Universitas Negeri 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