科研之友
微信
新浪微博
Facebook
分享链接
摘要
The harmonic index H(G) of a graph G is the sum of the weights 2/d(u) + d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this work, a lower bound for the harmonic index of a graph with minimum degree at least three is obtained and the corresponding extremal graph is characterized.
- 出版日期2016
- 单位西北工业大学
