On degree resistance distance of cacti
A graph G G is called a cactus if each block of G G is either an edge or a cycle. Denote by Cact(n;t) C a c t ( n ; t ) the set of connected cacti possessing n n vertices and t t cycles. In a recent paper (Du etal., 2015), the Cact(n;t) C a c t ( n ; t ) with minimum degree resistance distance was characterized. We now determine the elements of Cact(n;t) C a c t ( n ; t ) with second-minimum and third-minimum degree resistance distances. In addition, some mistakes in Du etal. (2015) are pointed out.
degree resistance distance resistance distance cactus kirchhoff index