Inverse degree, Randic index and harmonic index of graphs
Copyright policy )Inverse degree, Randic index and harmonic index of graphs
Let G be a graph with vertex set V and edge set E. Let di be the degree of the vertex vi of G. The inverse degree, Randic index, and harmonic index of G are defined as ID = ?vi?V 1/di, R = ? vivj?E 1/?di dj , and H = ? vivj?E 2=(di + dj), respectively. We obtain relations between ID and R as well as between ID and H. Moreover, we prove that in the case of trees, ID > R and ID > H.
- Sungkyul University Korea (Republic of)
- SASTRA University India
- Sungkyunkwan University Korea (Republic of)
- University of Kragujevac Serbia
Extremal problems in graph theory, Graphical indices (Wiener index, Zagreb index, Randić index, etc.), degree (of vertex), Vertex degrees, Randić index, inverse degree, harmonic index
Extremal problems in graph theory, Graphical indices (Wiener index, Zagreb index, Randić index, etc.), degree (of vertex), Vertex degrees, Randić index, inverse degree, harmonic index
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).11 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.Top 10% 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.Top 10%
Citations provided by BIP!Popularity provided by BIP!