Divided Square Difference Cordial Labeling Of Join Some Spider graphs

Abstract

Let G be a graph with itsvertices and edges. On defining bijective fnnctionρ:V(G) →{0,1,…,p}. For each edge assign the label with 1 if ρ*(ab)=∣ρ(a)2 - ρ(b)2 / ρ(a) - ρ(b)∣ is odd or 0 otherwise such that |eρ(1) -eρ0≤1 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 greaterthan one namely J(SP(1m,2n)),J(SP(1m,2n,31)), (SP(1m,2n,32)),J(SP(1m,2n,41)),J(SP(1m,2n,51).

Keywords

• dividedsquare difference cordial labelings
• join spider graphs