
doi: 10.12723/mjs.26.7
A graph labelling is an assignment of integers to the vertices or edges or both subject to certain conditions. A Graph G(V, E) with p vertices and q edges is called a Contra Harmonic mean graph if it is possible to label all the vertices x ∈ V with distinct labels f(x) from {1, 2, 3, 4, …., p } in such a way that each edge e = uv is labelled with f uv = f(u) 2 + f(v) 2 f u +f(v) or f uv = f(u) 2 + f(v) 2 f u +f(v) are distinct.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
