Inequalities between degree- and distance-based graph invariants

DOI10.1186/s13660-018-1633-yzbMath1387.05133OpenAlexW2795219839WikidataQ50283751 ScholiaQ50283751MaRDI QIDQ1697635

Imran Nadeem, Hani Shaker

Publication date: 20 February 2018

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-018-1633-y

zbMATH Keywords

inequalitiestopological indicesdegree-based indexdistance-based index

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

Comparative study of distance-based graph invariants

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the atom-bond connectivity index and radius of connected graphs
• Some lower and upper bounds on the third ABC index
• New bounds for randic and GA indices
• Relations between distance-based and degree-based topological indices
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• Sharp bounds for the general sum-connectivity indices of transformation graphs
• Further inequalities between vertex-degree-based topological indices
• The Randić index and the diameter of graphs
• Comparison between the Szeged index and the eccentric connectivity index
• Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
• The relationship between the eccentric connectivity index and Zagreb indices
• On the eccentric connectivity index and Wiener index of a graph
• On eccentric connectivity index
• Series expansion of the directed percolation probability

This page was built for publication: Inequalities between degree- and distance-based graph invariants