In this study, we offer the novel idea of maximizing multiplicative labeling and develop a method for doing so. A function f is called a maximization of multiplicative labeling of a graph G with q edges, if f is a bijective function from the vertices of G to the set such that when each edge uv is assigned the label , then the resulting edge labels are distinct numbers. A function is said to be minimization of multiplicative labeling of a graph G with ???? −edges if ???? is bijective function from the vertices of G to the set to such an extent that when each edge ???????? is attach with the label then the resulting edge labels are different numbers. Moreover, here we are investigating some examples like Jahangir graph, Gear graph , graph, Triangular Book graph, and ⊙ graph for the minimization of multiplicative labeling. In this paper, we have investigated some families of graphs which admit maximization of multiplicative labeling.