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 | |
| State | Published - 2016 |
Keywords
- Graph
- Harmonic index
- Minimum degree
Fingerprint
Dive into the research topics of 'A lower bound for the harmonic index of a graph with minimum degree at least three'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver