Kekuatan Ketidakteraturan Modular pada Graf Lintasan Beranting Tiga dan Graf Tangga Beranting Satu

Abstract

A modular irregular labeling of a graph 𝐺 with order 𝑛 is mapping of the set edges of the graph to 1, 2, … , 𝑘 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 𝑛. 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 triple-pendant path graph and pendant ladder graph. Furthermore, we determine the modular irregularity strength of triple-pendant path graph and pendant ladder graph. The result shows that triple-pendant path graph and pendant ladder graph admit a modular irregular labeling and its modular irregularity strength equal with its irregularity strength.