| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 417804 | Discrete Applied Mathematics | 2016 | 7 Pages |
Abstract
Consider the family CC of all connected simple graphs on nn vertices which have kk cut-vertices. We state some properties of the graph in CC which has the minimum Kirchhoff index. In particular, we characterize this graph in the cases that k≤n2 or k≥n−3k≥n−3. Also we characterize the graph GG in CC having a non-cut-vertex with the lowest resistive eccentricity index among all non-cut-vertices of all graphs in CC.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ashkan Nikseresht,