More ordering on the difference between atom-bond connectivity index and Randić index of binary trees

DOI10.1080/09720529.2020.1848102zbMath1502.05104OpenAlexW3139050579MaRDI QIDQ5059563

Zhibin Du, Wan Nor Nabila Nadia Wan Zuki, Roslan Hasni

Publication date: 23 December 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1848102

zbMATH Keywords

binary treesRandić indexatom-bond connectivity index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sum-connectivity index of a graph
• On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
• The maximum atom-bond connectivity index for graphs with edge-connectivity one
• On atom-bond connectivity index of connected graphs
• On the maximum ABC index of graphs without pendent vertices
• On a relation between the atom-bond connectivity and the first geometric-arithmetic indices
• More results on extremum Randic indices of (molecular) trees
• A note on the connectivity of direct products of graphs
• The rainbow connectivity of cartesian product graphs
• The ABC index conundrum
• More on comparison between first geometric-arithmetic index and atom-bond connectivity index

This page was built for publication: More ordering on the difference between atom-bond connectivity index and Randić index of binary trees