The unicyclic graphs with maximum degree resistance distance

摘要

For a connected graph with order 11 and size m, the cyclomatic number (=number of independent cycles) is equal to gamma - m - n + 1. The graphs with gamma - 1 are referred to the unicyclic graphs. In this paper, we characterized completely the unicyclic graphs with n vertices having maximum degree resistance distance. (C) 2015 Elsevier Inc. All rights reserved.