The unicyclic graphs with maximum degree resistance distance

作者：

Highlights：

•

摘要

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

论文关键词：Mathematical chemistry,Resistance distance,Degree resistance distance,Unicyclic graphs

论文评审过程：Received 12 May 2015, Revised 10 June 2015, Accepted 15 June 2015, Available online 23 July 2015, Version of Record 23 July 2015.

论文官网地址：https://doi.org/10.1016/j.amc.2015.06.063