Cargando…
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...
Autores principales: | Nadeem, Imran, Shaker, Hani |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2018
|
Materias: | |
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 |
Ejemplares similares
Ejemplares similares
-
On reciprocal degree distance of graphs
por: An, Mingqiang, et al.
Publicado: (2023) -
Distance-based topological polynomials and indices of friendship graphs
por: Gao, Wei, et al.
Publicado: (2016) -
On distance-based topological indices and co-indices of fractal-type molecular graphs and their respective graph entropies
por: Malik, Mehar Ali, et al.
Publicado: (2023) -
Manifold construction based on local distance invariance
por: Cheng, Wei-Chen, et al.
Publicado: (2010) -
The effect of genome graph expressiveness on the discrepancy between genome graph distance and string set distance
por: Qiu, Yutong, et al.
Publicado: (2022)