文章基本信息

标题：Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
本地全文：下载
作者：Gaixiang Cai ; Xing-Xing Li ; Guidong Yu 等
期刊名称：Discrete Dynamics in Nature and Society
印刷版ISSN：1026-0226
电子版ISSN：1607-887X
出版年度：2021
卷号：2021
页码：1-14
DOI：10.1155/2021/9998763
出版社：Hindawi Publishing Corporation
摘要：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.