Inverse sum indeg coindex of graphs
The inverse sum indeg coindex $\overline{ISI}(G)$ of a simple connected graph $G$ is defined as the sum of the terms $\frac{d_G(u)d_G(v)}{d_G(u)+d_G(v)}$ over all edges $uv$ not in $G,$ where $d_G(u)$ denotes the degree of a vertex $u$ of $G.$ In this paper, we present the upper bounds on inverse su...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Vasyl Stefanyk Precarpathian National University
2019-12-01
|
| Edice: | Karpatsʹkì Matematičnì Publìkacìï |
| Témata: | |
| On-line přístup: | https://journals.pnu.edu.ua/index.php/cmp/article/view/2117 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|