Reformulated Reciprocal Degree Distance of Transformation Graph

The reformulated reciprocal degree distance is defined for a connected graph G   as Rt‾(G)=12∑u,v∈V(G)(d(u)+d(v))dG(u,v)+t,t≥0. The reformulated reciprocal degree distance is a weight version of the t  -Harary index, that is, Ht‾(G)=12∑u,v∈V(G)1dG(u,v)+t,t≥0. In this paper, the reformulated reciprocal degree distance and reciprocal degree distance of the Mycielskian graph and the complement of the Mycielskian graph are obtained.