Kekuatan Ketidakteraturan Modular pada Graf Caterpillar Teratur

Abstract

A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2, … , 𝑘 such that different weights for all vertices. The weight of each vertex is obtained from the sum of the incident edge labels with that vertex in modulo 𝑛. The modular irregular strength is the minimum largest edge label such that a modular irregular labeling can be done. The modular irregularity strength value of 𝐺 is denoted by 𝑚𝑠(𝐺). In this research, we find strength of the modular irregularity of the graph 𝐶3,𝑛 and graph graf 𝐶4,𝑛. The results show that the graph 𝐶3,𝑛 and graph 𝐶4,𝑛 is a label for modular irregularity and at the same time produces a value for the strength of modular irregularity.