Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2021/9998763 |