Degree Resistance Distance Of Unicyclic Graphs

Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR (G) = Sigma {u,v} subset of v(G) [d(u) + d (v)] R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between u and v. In this paper, we characterize n -vertex unicyclic graphs having minimum and second minimum degree resistance distance.