Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Isnaini Rosyida
Department of Mathematics Faculty of mathematics and Natural Sciences Universitas Negeri Semarang
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Computing total edge irregularity strength of some n-uniform cactus chain graphs and related chain graphs Isnaini Rosyida; Diari Indriati
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2020.4.1.6

Abstract

Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G. A cactus graph G is a connected graph where no edge lies in more than one cycle. A cactus graph consisting of some blocks where each block is cycle Cn with same size n is named an n-uniform cactus graph. If each cycle of the cactus graph has no more than two cut-vertices and each cut-vertex is shared by exactly two cycles, then G is called n-uniform cactus chain graph. In this paper, we determine tes of n-uniform cactus chain graphs C(Cnr) of length r for some n ≡ 0 mod 3. We also investigate tes of related chain graphs, i.e. tadpole chain graphs Tr(4,n) and Tr(5,n) of length r. Our results are as follows: tes(C(Cnr)) = ⌈(nr + 2)/3⌉ ; tes(Tr(4,n)) = ⌈((5+n)r+2)/3⌉ ; tes(Tr(5,n)) = ⌈((5+n)r+2)/3⌉.
Co-Authors Diari Indriati