Inverse Sum Indeg Coindex of Graphs

K. Pattabiraman

Abstract


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 sum indeg coindex of edge corona product graph and Mycielskian graph. In addition,
we obtain the exact value of both inverse sum indeg index and its coindex of a double graph.

Keywords


Inverse sum indeg index, edge corona graph, Mycielskian graph, double graph

Full Text: Article
3 :: 11

Refbacks

  • There are currently no refbacks.


Creative Commons License
The journal is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported.