Square Product Labeling of Cactus Graphs

A graph G is said to be square product labeling if there exists a bijection f from V(G) to {1, 2, 3, ..., p} which induces f ^∗ from E(G) to N defined by f ^∗(uv) = f (u)²f (v)² is injective for each uv ∈ E(G), for which the resulting edges are distinctly labeled. G is considered to be a square product graph if it permits a square product labeling. In this article, the results are obtained on square product labeling for cactus graphs.