Minimal Harary Index of Graphs with Small Parameters

作者：Feng, Lihua^*; Lan, Yongxin; Liu, Weijun^*; Wang, Xia

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2016, 76(1): 23-42.

• WIENER POLARITY INDEX
• TOPOLOGICAL INDEXES
• UNICYCLIC GRAPHS
• BICYCLIC GRAPHS
• RECIPROCAL DISTANCE
• RANDIC INDEX
• TREES
• NUMBER
• DESCRIPTORS
• INVARIANTS

Let G be a simple connected graph with vertex set V (G). The Harary index G is defined as H(G) = Sigma({u,v}subset of V(G)) 1/d(G)(u, v), where d(G)(u, v) is the distance between u and v. In this paper, we study the minimal Harary index of graphs with small graph parameters such as diameter, matching number and independence number. In many cases, we also determine the extremal graphs.

• 出版日期2016
• 单位南开大学; 中南大学; 南通大学