Name
Abstract | ||
|---|---|---|
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the first up to seventh smallest Harary indices of trees of order n=16 and the first up to eighth greatest Harary indices of trees of order n=14. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.dam.2011.08.014 | Discrete Applied Mathematics |
Keywords | Field | DocType |
order n,connected graph,harary index,greatest harary index,smallest harary index,graph transformation,tree | Discrete mathematics,Combinatorics,Vertex (geometry),Graph rewriting,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
160 | 3 | 0166-218X |
Citations | PageRank | References |
10 | 0.74 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kexiang Xu | 1 | 72 | 11.43 |