The unicyclic graphs with maximum degree resistance distance

详细信息    查看全文

• 作者：Jianhua Tu ^{tujh81@163.com" class="auth_mail" title="E-mail the corresponding author} ; Junfeng Du ^{djfdjf1990@163.com" class="auth_mail" title="E-mail the corresponding author} ; Guifu Su ; ^{gfs1983@126.com" class="auth_mail" title="E-mail the corresponding author} ; ^{gfs86@uga.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Mathematical chemistry ; Resistance distance ; Degree resistance distance ; Unicyclic graphs
• 刊名：Applied Mathematics and Computation
• 出版年：2015
• 出版时间：1 October 2015
• 年：2015
• 卷：268
• 期：Complete
• 页码：859-864
• 全文大小：423 K

文摘

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.