A lower bound for the harmonic index of a graph with minimum degree at least three

Ming Hong Cheng, Ligong Wang

科研成果: 期刊稿件文章同行评审

7 引用 (Scopus)

摘要

The harmonic index H(G) of a graph G is the sum of the weights (Formula Presented) 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.

源语言英语
页(从-至)2249-2260
页数12
期刊Filomat
30
8
DOI
出版状态已出版 - 2016

指纹

探究 'A lower bound for the harmonic index of a graph with minimum degree at least three' 的科研主题。它们共同构成独一无二的指纹。

引用此