Abstract
The Harary index is defined as the sum of reciprocals of distances between all the vertex pairs of a connected graph. In this paper we present upper bounds on Harary index of unicyclic graphs with a given matching number and characterize the extremal graphs for which the upper bounds on Harary index are attained.
| Original language | English |
|---|---|
| Pages (from-to) | 71-86 |
| Number of pages | 16 |
| Journal | Studia Universitatis Babes-Bolyai Chemia |
| Volume | 2013 |
| Issue number | 2 |
| State | Published - 2013 |
Keywords
- Graph
- Harary index
- Reciprocal distance
- Upper bound