Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs

Gaixiang Cai, Xing-Xing Li, Guidong Yu and Junwei Wang

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

Abstract: The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n vertices. We study the graph with the maximum reciprocal degree resistance distance index among all graphs in ℬn and characterize the corresponding extremal graph.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ddns/2021/9998763.pdf (application/pdf)
http://downloads.hindawi.com/journals/ddns/2021/9998763.xml (application/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:9998763

DOI: 10.1155/2021/9998763

Access Statistics for this article

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