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

Descripción completa

Detalles Bibliográficos
Autores principales: Nadeem, Imran, Shaker, Hani
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5814576/
https://www.ncbi.nlm.nih.gov/pubmed/29491690
http://dx.doi.org/10.1186/s13660-018-1633-y
Descripción
Sumario: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 Randić connectivity, GA, ABC, and harmonic indices and distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, Wiener, and third ABC indices.

Ejemplares similares