Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs. (8th August 2020)

• Record Type: Journal Article
• Authors: Cai, Gai-Xiang; Li, Xing-Xing; Yu, Gui-Dong
• Other Names: Javaid Muhammad Guest Editor.
• Is Part Of: Discrete dynamics in nature and society. Volume 2020(2020)
• Publication Date: 2020-08-08
• Subjects: System analysis -- Periodicals; Dynamics -- Periodicals; Chaotic behavior in systems -- Periodicals; Differentiable dynamical systems -- Periodicals; 003.05
• DOI: 10.1155/2020/7318968
• 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 U n denote the set of unicyclic graphs with n vertices. We study the graph with maximum reciprocal degree resistance distance index among all graphs in U n and characterize the corresponding extremal graph.