Maximum reciprocal degree resistance distance index of unicyclic graphs (Q2195497): Difference between revisions

Summary: The reciprocal degree resistance distance index of a connected graph \(G\) is defined as \(\mathrm{RDR}\left( G\right)={\sum_{\left\{ u, v\right\} \subseteq V \left( G\right)} \left( \left( d_G \left( u\right) + d_G \left( v\right)\right) / \left( r_G \left( u, v\right)\right)\right)} \), where \(r_G\left( u, v\right)\) is the resistance distance between vertices \(u\) and \(v\) in \(G\). Let \(\mathcal{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 \(\mathcal{U}_n\) and characterize the corresponding extremal graph.