Square Difference Labeling of Some Graphs

The paper considers some methods to construct square difference labeling of cactus cycle C _m ⁽ⁿ⁾ of single-point connection of n copies of cycle C_m and n copies of path P₂ of single-point connection of n copies of cycle C_m and path P_n+1 as well as disjoint union of single-point connection of n copies of cycle C_m with path P_n.