Isnaini, Rosyida (2020) On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices. Journal of Discrete Mathematical Sciences and Cryptography, 23 (6). pp. 1335-1358. ISSN 2169-0065

PDF Download (755kB)

Abstract

Let GV 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 2 ( ) n C Cr n − having ( 2) n r − pendant vertices and length r. The result obtained is as follows: 2 (2 2) 2 3 (( ) n r n n r tes C C −   − + =   for n ≥ 6.

Actions (login required)

View Item