Main Article Content
A Radio square difference Dd-distance coloring of a connected graph is an injective function from the vertex set to the set of natural numbers such that for two distinctverticesandofthe-distance between and anddenotes the diameter of . The radio square difference number of , is the maximum label assigned to any vertex of. The radio square difference number of ,() is the minimum label of . In this paper we find the radio squareDd-distance difference number of some degree splitting graph.