Pelabelan Tidak Teratur Modular pada Graf Hasil Operasi Korona Lingkaran dan Lintasan

Abstract

A modular irregular graph is a graph that admits a modular irregular labeling, a modular irregular labeling of a graph G with order n is mapping of the set edges of the graph to {1,2,…,k} such that the weights of all vertices are different. The vertex weight is the sum of its incident edge labels, and all vertex weights are calculated with the sum modulo n. The modular irregularity strength is the minimum largest edge label such that a modular irregular labeling can be done. In this research, we define modular irregular labeling of graph C_n⊙P_m n≥3 and 2≤m≤5. Furthermore, we determine the modular irregularity strength of graph C_n⊙P_m n≥3 and 2≤m≤5. The results of this research graph C_n⊙P_m n≥3 and 2≤m≤5 admit a modular irregular labeling and its modular irregularity strength equal whit its irregularity strength.