The reciprocal degree distance of trees with given independence number
Let G be a simple undirected connected graph,Tn,αbe the set of trees with independence number α and order n.In this paper,we discuss the maximum reciprocal degree distance of trees in Tn,α and characterize the unique corresponding extremal graph.