Isnaini Rosyida, Eka Ningrum, Mulyono, Diari Indriati
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 (Figure presented.) having (n - 2)r pendant vertices and length r. The result obtained is as follows: (Figure presented.) for n ≥ 6. © 2020 Taru Publications.
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, Surakarta, Indonesia
