On the inverse degree index and decompositions in graphs
The inverse degree index of a graph $G=(V,E)$ without isolated vertices is defined as $\ID(G)=\sum_{v\in V}\frac{1}{dv}$, where $dv$ is the degree of the vertex $v$ in $G$. In this paper, we show a relation between the inverse degree of a graph and the inverse degree indices of the primary subgraphs...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2019-10-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://journalskuwait.org/kjs/index.php/KJS/article/view/6170 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!