Reformulated Reciprocal Degree Distance of Transformation Graph

详细信息    查看全文

• 作者：K. Pattabiraman ^{pramank@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Reciprocal degree distance ; Mycielskian graph
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2016
• 出版时间：September 2016
• 年：2016
• 卷：53
• 期：Complete
• 页码：259-270
• 全文大小：219 K

文摘

The reformulated reciprocal degree distance is defined for a connected graph G   as $\overline{R_t}(G)=\frac{1}{2}{\sum }_{u,v\in V(G)}\frac{(d(u)+d(v))}{d_G(u,v)+t},t\ge 0$. The reformulated reciprocal degree distance is a weight version of the t  -Harary index, that is, $\overline{H_t}(G)=\frac{1}{2}{\sum }_{u,v\in V(G)}\frac{1}{d_G(u,v)+t},t\ge 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.