Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs. (19th June 2021)

• Record Type: Journal Article
• Authors: Cai, Gaixiang; Li, Xing-Xing; Yu, Guidong
• Other Names: Wang Junwei Academic Editor.
• Is Part Of: Discrete dynamics in nature and society. Volume 2021(2021)
• Publication Date: 2021-06-19
• Subjects: System analysis -- Periodicals; Dynamics -- Periodicals; Chaotic behavior in systems -- Periodicals; Differentiable dynamical systems -- Periodicals; 003.05
• DOI: 10.1155/2021/9998763
• Languages: English
• ISSNs: 1026-0226

Abstract

Abstract : The reciprocal degree resistance distance index of a connected graph G is defined as RDR G = ∑ u, v ⊆ V G d G u + d G v / r G u, v, where r G u, 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.