A short note on inverse sum indeg index of graphs
Authors:
- 25 October 2019
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 14 (01)
Abstract
The inverse sum indeg index of a graph [ ] is defined as [ ], where [ ] is the degree of the vertex [ ]. In a recent paper, Pattabiraman [Inverse sum indeg index of graphs, AKCE Int. J. Graphs Combinat. 15(2) (2018) 155–167] gave some lower and upper bounds on [ ] index of all connected graphs in terms of Harmonic index, second Zagreb index and hyper Zagreb index. But some results were erroneous. In this note, we have corrected these results.Keywords
This publication has 4 references indexed in Scilit:
- Inverse sum indeg index of graphsAKCE International Journal of Graphs and Combinatorics, 2018
- The inverse sum indeg index of graphs with some given parametersDiscrete Mathematics, Algorithms and Applications, 2018
- Sharp bounds on the inverse sum indeg indexDiscrete Applied Mathematics, 2017
- On the inverse sum indeg indexDiscrete Applied Mathematics, 2015