| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4626388 | Applied Mathematics and Computation | 2015 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jianhua Tu, Junfeng Du, Guifu Su,