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

Ming Hong Cheng; Ligong Wang

doi:10.2298/FIL1608249C

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

Ming Hong Cheng, Ligong Wang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	2249-2260
Number of pages	12
Journal	Filomat
Volume	30
Issue number	8
DOIs	https://doi.org/10.2298/FIL1608249C
State	Published - 2016

Keywords

Graph
Harmonic index
Minimum degree

Access to Document

10.2298/FIL1608249C

Cite this

@article{9face17e1a414b39b45a3e8bb4705cc2,

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

abstract = "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.",

keywords = "Graph, Harmonic index, Minimum degree",

author = "Cheng, {Ming Hong} and Ligong Wang",

year = "2016",

doi = "10.2298/FIL1608249C",

language = "英语",

volume = "30",

pages = "2249--2260",

journal = "Filomat",

issn = "0354-5180",

publisher = "Universitet of Nis",

number = "8",

}

TY - JOUR

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

AU - Cheng, Ming Hong

AU - Wang, Ligong

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Graph

KW - Harmonic index

KW - Minimum degree

UR - http://www.scopus.com/inward/record.url?scp=85006049230&partnerID=8YFLogxK

U2 - 10.2298/FIL1608249C

DO - 10.2298/FIL1608249C

M3 - 文章

AN - SCOPUS:85006049230

SN - 0354-5180

VL - 30

SP - 2249

EP - 2260

JO - Filomat

JF - Filomat

IS - 8

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this