Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs

[摘要] The reciprocal degree resistance distance index of a connected graph is defined as , where is the resistance distance between vertices and in . Let denote the set of bicyclic graphs without common edges and with vertices. We study the graph with the maximum reciprocal degree resistance distance index among all graphs in and characterize the corresponding extremal graph.

[学科分类] 安全、风险、质量和可靠性