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 $D_R(G) = sum_{{u‎, ‎v} subseteq 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‎. ‎