Upper bounds for the inverse sum indeg index of graphs
From MaRDI portal
Publication:1627868
DOI10.1016/j.dam.2018.05.060zbMath1401.05068OpenAlexW2809595951MaRDI QIDQ1627868
Igor Ž. Milovanović, Marjan M. Matejić, Emina I. Milovanović
Publication date: 3 December 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.060
Related Items (7)
SOME BOUNDS ON INVERSE SUM INDEG INDEX OF SOME GRAPH OPERATIONS ⋮ On connected graphs and trees with maximal inverse sum indeg index ⋮ Inverse sum indeg reciprocal status index and co-index of graphs ⋮ Linear and non-linear inequalities on the inverse sum indeg index ⋮ Some new upper bounds for the inverse sum indeg index of graphs ⋮ A note on the minimum inverse sum indeg index of cacti ⋮ Some inequalities on the inverse sum indeg coindex
Uses Software
Cites Work
- Sharp bounds on the inverse sum indeg index
- On a novel connectivity index
- Some results on the inverse sum indeg index of a graph
- Inverse sum indeg index of graphs
- Symmetric division deg and inverse sum indeg indices of polycyclic aromatic hydrocarbons (PAHs) and polyhex nanotubes
- On general sum-connectivity index
- On the inverse sum indeg index
- A forgotten topological index
- On the Arithmetic and Geometric Means and on Holder's Inequality
- The inverse sum indeg index of graphs with some given parameters
- Analytic Inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bounds for the inverse sum indeg index of graphs