Reformulated Reciprocal Degree Distance and Reciprocal Degree Distance of the Complement of the Mycielskian Graph and Generalized Mycielskian

Feifei Zhao, Hong Bian, Haizheng Yu and Min Liu

Mathematical Problems in Engineering, 2019, vol. 2019, 1-8

Abstract:

The reformulated reciprocal degree distance is defined for a connected graph as , which can be viewed as a weight version of the Harary index; that is, . In this paper, we present the reciprocal degree distance index of the complement of Mycielskian graph and generalize the corresponding results to the generalized Mycielskian graph.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/3764981.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/3764981.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3764981

DOI: 10.1155/2019/3764981

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().