Comparison between the zeroth-order Randić index and the sum-connectivity index
From MaRDI portal
Publication:668864
DOI10.1016/j.amc.2015.11.029zbMath1410.05105OpenAlexW2184477882MaRDI QIDQ668864
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.11.029
Related Items (11)
Inverse degree, Randic index and harmonic index of graphs ⋮ Relationships between some distance-based topological indices ⋮ Further results on the Merrifield-Simmons index ⋮ Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ General sum-connectivity index of a graph and its line graph ⋮ The general Randić index of trees with given number of pendent vertices ⋮ Beyond the Zagreb indices ⋮ On the general sum-connectivity index of trees with given number of pendent vertices ⋮ Comparative study of distance-based graph invariants ⋮ Ordering chemical graphs by Randić and sum-connectivity numbers
Cites Work
- Unnamed Item
- The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- Inequalities for entropy-based measures of network information content
- On a novel connectivity index
This page was built for publication: Comparison between the zeroth-order Randić index and the sum-connectivity index