I. ROSYIDA, D. INDRIATI
A total k-labeling f that assigns V ∪ E into {1, 2, …, k} on graph G is named vertex irregular if wtf(u) = wtf(v) for dissimilar vertices u,v in G with the weights wt f (u) = f(u) + ???e(G) f(ux). We call the minimum number k utilized in total labeling f as a total vertex irregularity strength of G, symbolized by tvs(G). In this research, we focus on tadpole chain graphs that are chain graphs which contain tadpole graphs in their blocks. We investigate tvs of some classes of tadpole chain graphs,. i.e., Tr (4,n) and Tr (5,n) with length r. Some formulas are derived as follows: im (n + 1)r + 3 (n + 2)r + 3 tvs(Tr(4,n)) ???and tvs( T r(5,n)) ???. © 2021
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Indonesia; Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, Surakarta, Indonesia
