Lower Bounds for Inverse Sum Indeg Index of Graphs
Work
Year: 2020
Type: article
Abstract: Let G = (V,E), V = {1, 2,…,n}, be a simple connected graph with n vertices and m edges and let d1 ≥ d2 ≥⋅ ⋅⋅≥ dn > 0, be the sequence of its vertex degrees. With i ∼ j we denote the adjacency of th... more
Institutions University of Kragujevac, University of Nis
Cites: 24
Cited by: 17
Related to: 10
FWCI: 2.887
Citation percentile (by year/subfield): 99.98
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond