科研之友
微信
新浪微博
Facebook
分享链接
摘要
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}cv(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 the graphs having maximum and minimum degree Kirchhoff index among all n-vertex bicyclic graphs with exactly two cycles.
- 出版日期2017-3
- 单位湖南师范大学
