The unicyclic graphs with maximum degree resistance distance

For a connected graph with order n and size m  , the cyclomatic number (=number of independent cycles) is equal to γ=m−n+1γ=m−n+1. The graphs with γ=1γ=1 are referred to the unicyclic graphs. In this paper, we characterized completely the unicyclic graphs with n vertices having maximum degree resistance distance.