Divided square difference cordial Labeling of join some spider graphs

¹ Department of Mathematics Patrician College of arts and Science, Affiliated to University of Madras, Chennai
² Department of Mathematics, Dr. Ambedkar Goverment Arts College, Chennai

^* Corresponding author: gpalani32@yahoo.co.in

Abstract

Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label with 1 if ρ*(ab)= | ρ(a)²−ρ(b)²/ρ(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 greater than one namely J(SP(1^m,2ⁿ)) ,J(SP(1^m,2ⁿ,3¹)), (SP(1^m,2ⁿ,3²)),J(SP(1^m,2ⁿ,4¹)),J(SP(1^m,2ⁿ,5¹). AMS Mathematics Subject Classification:05C78.