Inverse sum indeg index of graphs
The inverse sum indeg index I S I (G) of a simple graph G is defined as the sum of the terms d G (u) d G (v) d G (u) + d G (v) over all edges u v of G , where d G (u) denotes the degree of a vertex u of G . In this paper, we present several upper and lower bounds on the inverse sum indeg index in te...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016301645 |