The Smallest Harmonic Index of Trees with Given Maximum Degree
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-05-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2019 |
| id |
doaj-2d1835e4f29b4eaeae14bf23e05c00ac |
|---|---|
| record_format |
Article |
| spelling |
doaj-2d1835e4f29b4eaeae14bf23e05c00ac2021-09-05T17:20:23ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922018-05-0138249951310.7151/dmgt.2019dmgt.2019The Smallest Harmonic Index of Trees with Given Maximum DegreeRasi Reza0Sheikholeslami Seyed Mahmoud1Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. IranDepartment of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. IranThe 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.https://doi.org/10.7151/dmgt.2019harmonic indextrees05c1292e10 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Rasi Reza Sheikholeslami Seyed Mahmoud |
| spellingShingle |
Rasi Reza Sheikholeslami Seyed Mahmoud The Smallest Harmonic Index of Trees with Given Maximum Degree Discussiones Mathematicae Graph Theory harmonic index trees 05c12 92e10 |
| author_facet |
Rasi Reza Sheikholeslami Seyed Mahmoud |
| author_sort |
Rasi Reza |
| title |
The Smallest Harmonic Index of Trees with Given Maximum Degree |
| title_short |
The Smallest Harmonic Index of Trees with Given Maximum Degree |
| title_full |
The Smallest Harmonic Index of Trees with Given Maximum Degree |
| title_fullStr |
The Smallest Harmonic Index of Trees with Given Maximum Degree |
| title_full_unstemmed |
The Smallest Harmonic Index of Trees with Given Maximum Degree |
| title_sort |
smallest harmonic index of trees with given maximum degree |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2018-05-01 |
| description |
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. |
| topic |
harmonic index trees 05c12 92e10 |
| url |
https://doi.org/10.7151/dmgt.2019 |
| work_keys_str_mv |
AT rasireza thesmallestharmonicindexoftreeswithgivenmaximumdegree AT sheikholeslamiseyedmahmoud thesmallestharmonicindexoftreeswithgivenmaximumdegree AT rasireza smallestharmonicindexoftreeswithgivenmaximumdegree AT sheikholeslamiseyedmahmoud smallestharmonicindexoftreeswithgivenmaximumdegree |
| _version_ |
1717786425224593408 |