Inverse sum indeg coindex of graphs

  • K. Pattabiraman Annamalai University, Annamalainagar, 608002, Tamil Nadu, India, Government Arts College, 612002, Kumbakonam, India
Keywords: inverse sum indeg index, edge corona graph, Mycielskian graph, double graph
Published online: 2019-12-31

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.

Article metrics
PDF downloads: 197
Abstract views: 400
How to Cite
(1)
Pattabiraman K. Inverse Sum Indeg Coindex of Graphs. Carpathian Math. Publ. 2019, 11 (2), 399-406.