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. The degree resistance distance of G is defined as D-R(G) = Sigma({u, v}subset of) (V(G)) (d(u) + d(upsilon)) r(u, v), where d(u) is the degree of the vertex u. Let G(n,m) be the set of connected graphs with order n and m edges. In this paper, we'll determine the extremal graphs among G(n,m) with the minimum degree resistance distance.