A short note on inverse sum indeg index of graphs

Selvaraj Balachandran, Suresh Elumalai, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


The inverse sum indeg index of a graph G is defined as ISI(G) =?uv E(G) d(u)d(v) d(u)+d(v), where d(u) is the degree of the vertex u. 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 ISI 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.

Original languageEnglish
Article number2050152
JournalAsian-European Journal of Mathematics
Issue number1
StatePublished - Jan 2021

Bibliographical note

Funding Information:
We would like to thank the reviewer for careful and thorough reading of this paper and for the thoughtful comments and constructive suggestions, which help to improve the quality of this paper. The second author’s research is supported by University of Haifa, Israel, for the Postdoctoral studies and it is gratefully acknowledged.

Publisher Copyright:
© 2021 World Scientific Publishing Company.


  • Inverse sum indeg index
  • maximum degree
  • minimum degree

ASJC Scopus subject areas

  • Mathematics (all)


Dive into the research topics of 'A short note on inverse sum indeg index of graphs'. Together they form a unique fingerprint.

Cite this