Strongly Multiplicative Labeling of Polygonal Chains, Stacked Prism Graph and Möbius Ladder

This paper explores the concept of strongly multiplicative labeling in graphs, where the product of labels of end vertices of edges is distinct. We investigate the existence of strongly multiplicative labeling in polygonal chains Pn, stacked prism graph Y (m, n) and möbius ladder M n. The finding demonstrates that these graphs admit strongly multiplicative labeling, supported by illustrative examples. This study advances the understanding of strongly multiplicative graphs and their potential applications in graph theory and related field such as cryptography, coding theory and network security.