On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices


Mulyono, - (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

[thumbnail of 5 Journal of Discrete Math Vol 23 Issue 6 th 2020 hal 1335_1358 - Mulyono Unnes.pdf] PDF - Published Version
Download (763kB)
[thumbnail of Turnitin] PDF (Turnitin)
Download (2MB)

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.

Item Type: Article
Uncontrolled Keywords: Edge irregular total k-labeling, Tes, Uniform, Cactus chain.
Subjects: Q Science > QA Mathematics
Fakultas: Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika, S1
Depositing User: dina nurcahyani perpus
Date Deposited: 10 Mar 2023 03:16
Last Modified: 14 Apr 2023 01:57
URI: http://lib.unnes.ac.id/id/eprint/56506

Actions (login required)

View Item View Item