Inequalities between degree- and distance-based graph invariants

Inequalities provide a way to study topological indices relatively. There are two major classes of topological indices: degree-based and distance-based indices. In this paper we provide a relative study of these classes and derive inequalities between degree-based indices such as Randic connectivity, GA, ABC, and harmonic indices and distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, Wiener, and third ABC indices.