Theoretical Approaches to Maximizing Even Multiplicative Labeling

Graph labeling is one of the most well-known parts of graph theory research, having a lengthy history that dates back to the 1960s. Assigning non-negative integer labels to a graph’s edges, vertex or both as long as certain conditions are satisfied is known as graph labeling. A graph G is held to have a maximization of even multiplicative labeling if it has p nodes, q edges and the labels for its vertices are $\{1,2,3 \ldots, 2 n\}$, while the labels for its edges are the product and maximum of its end vertices. The crown graph, dumb bell graph, tadpole graph, and bi-star graphs are examined in this study.