Divided Square Difference Cordial Labeling of Some Spider Graphs

Abstract

Let G be a graph with its vertices and edges. On defining bijective function VFor each edge assign the label with 1 if  is odd or 0 otherwise such that  then the labeling is called as Divided Square difference cordial labeling graph. We prove in this paper for relatively possible set of Spider graphs with atmost one legs greater than one namely SP(1^m,2ⁿ), SP(1^m,2ⁿ,3¹), SP(1^m,2ⁿ,3²), SP(1^m,2ⁿ,4¹), SP(1^m,2ⁿ,5¹).