文献类型：期刊文献

英文题名：The linear programming approach to the harmonic index of a graph with minimum degree at least three

作者：Chang, Renying[1];Zhu, Yan[2]

机构：[1]Nankai Univ, Ctr Combinator, LPMC, Tianjin 300071, Peoples R China;[2]East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2018

卷号：141

起止页码：85

外文期刊名：ARS COMBINATORIA

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000446809500007)】；

基金：This work is supported by the Fundamental Research Funds for the Central Universities.

语种：英文

外文关键词：Harmonic Index; Linear Programming; Minimum Degree

摘要：The harmonic index H(G) of a graph G is the sum of (2)(d(u)+d(u)) over all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this paper, we give the minimum value of H(G) for graphs G with given minimum degree delta(G) >= 3 and characterize the corresponding extremal graph.