TY  - JOUR
T1  - On the Total Irregularity Strength of M-Copy Cycles and M-Copy Paths
AU - Corazon Marzuki, Corry AU - Aryani, Fitri AU - , Abdussakir AU - Fitri, Ramadana AU - Nia Gianita, Fitria 
JO  - Research Journal of Applied Sciences
VL  - 13
IS  - 10
SP  - 582
EP  - 586
PY  - 2018
DA  - 2001/08/19
SN  - 1815-932x
DO  - rjasci.2018.582.586
UR  - https://makhillpublications.co/view-article.php?doi=rjasci.2018.582.586
KW  - M-copy cycles
KW  -total irregularity strength
KW  -Totally irregular total k-labeling
KW  -M-copy paths
KW  -weight
KW  -irregular
AB  - Let G = (V, E) be a graph. A totally irregular total k-labeling f: VUE6{1, 2, ..., k} of a graph G is a total labeling such that for any different vertices x and y of G, their weights wt. (x) and wt. (y) are distinct and for any different edges x<sub>1</sub>x<sub>2</sub> and y<sub>1</sub>y<sub>2</sub> of G, their weights wt. (x<sub>1</sub>x<sub>2</sub>) and wt (y<sub>1</sub>y<sub>2</sub>) are distinct. The weight wt (x) of a vertex x is the sum of the label of x and the labels of all edges incident with x. The weight wt. (x<sub>1</sub>x<sub>2</sub>) of an edge x<sub>1</sub>x<sub>2</sub> is the sum of the label of edge x<sub>1</sub> x<sub>2</sub> and the labels of vertices x<sub>1</sub> and x<sub>2</sub>. The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G, denoted by ts(G). In this study, we determine the total irregularity strength of M-copy cycles and M-copy paths.
ER  -