LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A short note on inverse sum indeg index of graphs

Photo by jordansteranka from unsplash

The inverse sum indeg index of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the degree of the vertex [Formula: see text].… Click to show full abstract

The inverse sum indeg index of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the degree of the vertex [Formula: see text]. 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 [Formula: see text] 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: sum indeg; index; inverse sum; see text; formula see; indeg index

Journal Title: Asian-European Journal of Mathematics
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.