A short note on inverse sum indeg index of graphs

Selvaraj Balachandran; Suresh Elumalai; Toufik Mansour

doi:10.1142/S1793557120501521

A short note on inverse sum indeg index of graphs

Selvaraj Balachandran, Suresh Elumalai, Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Article number	2050152
Journal	Asian-European Journal of Mathematics
Volume	14
Issue number	1
DOIs	https://doi.org/10.1142/S1793557120501521
State	Published - 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.

Keywords

Inverse sum indeg index
maximum degree
minimum degree

ASJC Scopus subject areas

Mathematics (all)

Access to Document

10.1142/S1793557120501521

Cite this

@article{f9c68474842b43a098351da8e72be070,

title = "A short note on inverse sum indeg index of graphs",

abstract = "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.",

keywords = "Inverse sum indeg index, maximum degree, minimum degree",

author = "Selvaraj Balachandran and Suresh Elumalai and Toufik Mansour",

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{\textquoteright}s research is supported by University of Haifa, Israel, for the Postdoctoral studies and it is gratefully acknowledged. Publisher Copyright: {\textcopyright} 2021 World Scientific Publishing Company.",

year = "2021",

month = jan,

doi = "10.1142/S1793557120501521",

language = "English",

volume = "14",

journal = "Asian-European Journal of Mathematics",

issn = "1793-5571",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "1",

}

TY - JOUR

T1 - A short note on inverse sum indeg index of graphs

AU - Balachandran, Selvaraj

AU - Elumalai, Suresh

AU - Mansour, Toufik

N1 - 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.

PY - 2021/1

Y1 - 2021/1

N2 - 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.

AB - 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.

KW - Inverse sum indeg index

KW - maximum degree

KW - minimum degree

UR - http://www.scopus.com/inward/record.url?scp=85074205675&partnerID=8YFLogxK

U2 - 10.1142/S1793557120501521

DO - 10.1142/S1793557120501521

M3 - Article

AN - SCOPUS:85074205675

VL - 14

JO - Asian-European Journal of Mathematics

JF - Asian-European Journal of Mathematics

SN - 1793-5571

IS - 1

M1 - 2050152

ER -

A short note on inverse sum indeg index of graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this