Inverse degree, randić index and harmonic index of graphs

Kinkar Ch Das, Selvaraj Balachandran, Ivan Gutman

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

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, Randić 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.

Original languageEnglish
Pages (from-to)304-313
Number of pages10
JournalApplicable Analysis and Discrete Mathematics
Volume11
Issue number2
DOIs
StatePublished - 2017

Keywords

  • Degree (of vertex)
  • Harmonic index
  • Inverse degree
  • Randić index

Fingerprint

Dive into the research topics of 'Inverse degree, randić index and harmonic index of graphs'. Together they form a unique fingerprint.

Cite this