For a connected graph G, the reciprocal degree distance $(RDD)$ of the graph G is defined as; $RDD(G)={\sum }_{u\ne v}\frac{{\mathrm{deg}}_G(u)+{\mathrm{deg}}_G(v)}{d_G(u,v)}$, where ${\mathrm{deg}}_G(u)$ is the degree of u in G and $d_G(u,v)$ is the distance between u and v in G. In this article, we give sufficient condition for a graph to be traceable, Hamiltonian, Hamiltonian-connected in terms of $RDD(G)$.

中文翻译：

---

图的倒数度距离和哈密顿性质

对于连通图G，倒数度距离$（右DD）$图G的定义为：$右DD（G）={\Sigma }_{你\ne v}\frac{{\mathrm{度}}_G（你）+{\mathrm{度}}_G（v）}{d_G（你,v）}$， 在哪里${\mathrm{度}}_G（你）$是u在G中的次数，$d_G（你,v）$是G中u和v之间的距离。在本文中，我们给出了图可追踪、哈密顿、哈密顿连通的充分条件：$右DD（G）$。