A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Computing total edge irregularity strength of some n-uniform cactus chain graphs and related chain graphs

2020
*
Indonesian Journal of Combinatorics
*

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Given graph </span>G<span>(</span><span>V,E</span><span>)</span><span>. We use the notion of total </span>k<span>-labeling which is edge irregular. The notion </span>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

doi:10.19184/ijc.2020.4.1.6
fatcat:fcx7b5jpizb7ndadoucwrmjg5a