Some new upper bounds for the inverse sum indeg index of graphs
Let G = (V,E) be a simple connected graph with the vertex set V = {1,2,...,n} and sequence of vertex degrees (d1,d2,...,dn) where di denotes the degree of a vertex i ∈ V. With i ∼ 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 d...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | EJournal Article |
| Publicat: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-04-01.
|
| Matèries: | |
| Accés en línia: | Get Fulltext |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Internet
Get Fulltext3rd Floor Main Library
| Signatura: |
A1234.567 |
|---|---|
| Còpia 1 | Disponible |