New Perspectives on CDPU Graphs

A graph G = (V, E) is Complementary Distance Pattern Uniform if there exists M subset of V(G) such that ƒM(u) = {d(u, v) : v in M}, for every u belongs to V(G)-M, is independent of the choice of u in V(G)-M and the set M is called the Complementary Distance Pattern Uniform Set (CDPU set). In this paper, we initiate a study on the CDPU sets of trees