Open AccessThe smallest harmonic index of trees with given maximum degree
Author(s) -
R. Rasi,
Seyed Mahmoud Sheikholeslami
Publication year - 2017
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2019
Subject(s) - mathematics , combinatorics , vertex (graph theory) , degree (music) , graph , index (typography) , upper and lower bounds , tree (set theory) , harmonic , discrete mathematics , mathematical analysis , physics , quantum mechanics , world wide web , computer science , acoustics
The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/[d(u) + d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom