Neighborhood Strongly Multiplicative Labeling of Graphs

Abstract

           In this study, we examine the neighborhood strongly multiplicative labeling for some graphs. Consider a graph with  vertices,  A bijective function   is referred as a neighborhood strongly multiplicative labeling (NSML), if for any vertex  with   product of  are all distinct. A neighborhood strongly multiplicative graph (NSMG) is one that allows for NSML. In this research, we establish the neighborhood strongly multiplicative nature of the Complete graph , Path graph   Pinwheel graph, Jellyfish graph .