Sign in
Back
Some new upper bounds for the inverse sum indeg index of graphs
Journal article   Open access  Peer reviewed

Some new upper bounds for the inverse sum indeg index of graphs

Akbar Ali, Marjan Matejic, Emina Milovanovic, Igor Milovanovic and Faculty of Electronic Engineering, University of Niˇs, P. O. Box 73 Niˇs 18000, Serbia
Electronic journal of graph theory and applications, Vol.8(1), pp.59-70
01/01/2020
DOI: https://doi.org/10.5614/ejgta.2020.8.1.5

Abstract

Mathematics Physical Sciences Science & Technology
Let G = (V, E) be a simple connected graph with the vertex set V = {1, 2, . . . , n} and sequence of vertex degrees (d(1), d(2), . . . , d(n)) where di denotes the degree of a vertex i is an element of V. With i similar to j, we denote the adjacency of the vertices i and j in the graph G. The inverse sum indeg (ISI) index of the graph G is defined as ISI(G) = Sigma(i similar to j)d(i)d(j)/d(i)+d(j). Some new upper bounds for the ISI index are obtained in this paper.
url
https://doi.org/10.5614/ejgta.2020.8.1.5View
Published (Version of record) Open

Metrics

1 Record Views

Details