Modular Irregular Labeling On Complete Graph And Complete Bipartite Graph
R. Selvaraj, S. Vidyanandini · 2024
A graph that allows for modular irregular labeling is a modular irregular labeling graph. A modular irregular labeling of a graph G of size n is a mapping of the graph’s set of edges to $1,2, \ldots, \mathrm{k}$ with the weights of all vertices distinct. The sum of a vertice’s incident edge labels is its weight and the weight of all vertex, determined using the method of additive modulo n. The least biggest edge label that can be used for modular irregular labeling is the modular irregularity strength. This article shows a modular irregular labeling of complete graph $K_{n}, \mathrm{n}=3,4, \ldots, 8$ and some families of complete bipartite graphs.