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...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 语言: | Inglês |
| 出版: |
Vasyl Stefanyk Precarpathian National University
2019-12-01
|
| 丛编: | Karpatsʹkì Matematičnì Publìkacìï |
| 主题: | |
| 在线阅读: | https://journals.pnu.edu.ua/index.php/cmp/article/view/2117 |
| 标签: |
没有标签, 成为第一个标记此记录!
|
