Inverse sum indeg index of graphs
The inverse sum indeg index of a simple graph is defined as the sum of the terms over all edges of where denotes the degree of a vertex of In this paper, we present several upper and lower bounds on the inverse sum indeg index in terms of some molecular structural parameters and relate this index to...
Main Author: | K. Pattabiraman |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2018-08-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.06.001 |
Similar Items
-
Note on inverse sum indeg index of graphs
by: Harishchandra S. Ramane, et al.
Published: (2020-09-01) -
Inverse sum indeg coindex of graphs
by: K. Pattabiraman
Published: (2019-12-01) -
Some new upper bounds for the inverse sum indeg index of graphs
by: Akbar Ali, et al.
Published: (2020-04-01) -
Inverse Sum Indeg Energy of Graphs
by: Sumaira Hafeez, et al.
Published: (2019-01-01) -
On the inverse sum indeg index of some graph operations
by: Özge Çolakoǧlu Havare
Published: (2020-05-01)