The resistance distance r(u, v) between two vertices u, v of a connected graph G is defined as the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge of G with a unit resistor. Let G be a connected graph, the degree resistance distance of G is defined as D-R(G) = Sigma({u,v}subset of V(G))[d(u) + d(v)]r(u, v), where d(u) is the degree of the vertex u. In this paper, we firstly characterize n-vertex unicyclic graphs with given girth having maximum and second maximum degree resistance distance, then give n-vertex unicyclic graphs with the maximum and second maximum degree resistance distance.
展开▼
