摘要

Let G be a connected graph with vertex set V(G). The degree Kirchhoff index of G is defined as S'(G) = Sigma({u,v}subset of V(G))d(u)d(v)R(u,v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between vertices u and v. In this paper we characterize n-vertex unicyclic graphs having maximum, second-maximum, minimum, and second-minimum degree Kirchhoff index.