Inverse sum indeg coindex of graphs | Zendy

K. Pattabiraman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inverse sum indeg coindex of graphs

Author(s) -

K. Pattabiraman

Publication year - 2019

Publication title -

carpathian mathematical publications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.63

H-Index - 4

eISSN - 2313-0210

pISSN - 2075-9827

DOI - 10.15330/cmp.11.2.399-406

Subject(s) - mathematics , combinatorics , inverse , graph , vertex (graph theory) , simple graph , connectivity , discrete mathematics , geometry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research