On Square Sum Labeling of Two Families of Petersen Graphs

A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f : V G ⟶ 0,1,2,3 , … , n − 1 such that the function f ∗ : E G ⟶ N defined by f ∗ s t = f s 2 + f t 2 , for all s t ∈ E G , is injective. A graph G having a square sum labeling is called square sum. In this study, we have investigated the square sum labeling of generalized Petersen graph and double generalized Petersen graph.