Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs

Gai-Xiang Cai, Xing-Xing Li and Gui-Dong Yu

Discrete Dynamics in Nature and Society, 2020, vol. 2020, 1-14

Abstract:

The reciprocal degree resistance distance index of a connected graph is defined as , where is the resistance distance between vertices and in . Let denote the set of unicyclic graphs with vertices. We study the graph with maximum reciprocal degree resistance distance index among all graphs in and characterize the corresponding extremal graph.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2020/7318968.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2020/7318968.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:jnddns:7318968

DOI: 10.1155/2020/7318968

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().