Modular Irregular Labeling On Complete Graphs

Indah Chairun Nisa (Universitas Hasanuddin)
Nurdin Nurdin (Universitas Hasanuddin)
Hasmawati Basir (Universitas Hasanuddin)

Jurnal Daya Matematis
Vol 10, No 3 (2022): Desember

Let G be a simple graph of n order. An edge labeling such that the weights of all vertex are different and elements of the set modulo n, are called a modular irregular labeling. The modular irregularity strength of G is a minimum positive integer k such that G have a modular irregular labeling. If the modular irregularity strength is none, then we called the modular irregularity strength of G is infinity. In this article, we determine the modular irregularity strength of complete graphs.