Certain Results on Pair Sum Labeling of Newly Constructed Graphs

Abstract

For a  graph , an injective map  from  to  is said to be a pair sum labeling if the induced edge function  from  to  defined by  is  and  is either of the form  or  depending on  which is either even or odd. A graph that admits the behavior of pair sum labeling is named a pair sum graph. In this manuscript we study the pair sum labeling of uniform -cyclic graph, -cyclic copies of  and path union of ladders.