Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

Abstract

We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree $T$, grid graph $P_{n}\times P_{m}$, complete bipartite graph $K_{m,n}$, $C_{n}\odot P_{m}$ and one-point union of $m$ cycle of length $n$ are strongly multiplicative.