共 50 条
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
被引:0
|作者:
Cai, Gaixiang
[1
]
Li, Xing-Xing
[1
]
Yu, Guidong
[1
,2
]
机构:
[1] Anqing Normal Univ, Sch Math & Phys, Anqing 246133, Peoples R China
[2] Hefei Presch Educ Coll, Basic Dept, Hefei 230013, Peoples R China
基金:
中国国家自然科学基金;
关键词:
MOLECULAR-ORBITALS;
HARARY INDEX;
D O I:
10.1155/2021/9998763
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The reciprocal degree resistance distance index of a connected graph G is defined as RDR(G) = Sigma({u,v}subset of 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 B-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 B-n and characterize the corresponding extremal graph.
引用
收藏
页数:14
相关论文