Square Product Labeling of Cactus Graphs
Synopsis
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)2f (v)2 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.
![ICAMCS 2022](https://books.aijr.org/public/presses/1/submission_138_113_coverImage_en_US_t.png)
Published
October 10, 2022
Series
Copyright (c) 2022 held by the author(s) of the individual abstract
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.