On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices
Isnaini Anniswati Rosyida, Eka Budi Merry Setia Ningrum, Mulyono Mulyono, Diari Indriati · Journal of Discrete Mathematical Sciences and Cryptography · 2020
Let G(V, E) be a graph. Throughout this paper, we use the notions of edge irregular total k-labeling and total edge irregularity strength of G (tes (G)). We verify tes of general uniform cactus chain graphs having (n - 2)r pendant vertices and length r. The result obtained is as follows: for n ≥ 6.