Modular Irregular Labeling on Complete Graphs and Complete Bipartite Graph

EasyChair Preprint 7503

Abstract

A Modular irregular graph is a graph that admits a modular irregular labeling. 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, …, 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 labelling can be done. In this paper, we construct a modular irregular labelling of complet graphs and complet bipartite graph.

Keyphrases: Modular Irregular Labeling, bipartite graph, graph labeling

@booklet{EasyChair:7503,
  author    = {R Selvaraj and S Vidyanandini},
  title     = {Modular Irregular Labeling on Complete Graphs and Complete Bipartite Graph},
  howpublished = {EasyChair Preprint 7503},
  year      = {EasyChair, 2022}}