On skolem difference mean labeling of some trees

A graph with vertices and edges is said to have skolem difference mean labeling if it is possible to label the vertices with distinct elements from in such a way that for each edge e = uv, let f*(e) = and the resulting labels of the edges are distinct and are from 1, 2, 3,…, q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove that Tp-tree T, T  , T @ and T @ 2 where T is a Tp-tree are extra skolem difference mean graphs.