The degree resistance distance of cacti
Graph invariants, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. The degree resistance distance  of a graph G G is defined as DR(G)=?{u,v}?V(G)[d(u)+d(v)]R(u,v) D R ( G ) = ? { u , v } ? V ( G ) [ d ( u ) + d ( v ) ] R ( u , v ) , where d(u) d ( u ) is the degree of the vertex u u , and R(u,v) R ( u , v ) the resistance distance between the vertices u u and v v . Let Cact(n;t) C a c t ( n ; t ) be the set of all cacti possessing n n vertices and t t cycles. The elements of Cact(n;t) C a c t ( n ; t ) with minimum degree resistance distance are characterized.
degree resistance distance resistance distance cactus