Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Inverse sum indeg coindex of graphs
View through CrossRef
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.
Vasyl Stefanyk Precarpathian National University
Title: Inverse sum indeg coindex of graphs
Description:
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.
Related Results
Bounds on Inverse Sum Indeg Index of Subdivision Graphs
Bounds on Inverse Sum Indeg Index of Subdivision Graphs
The inverse sum indeg index ISI(G) of a simple graph G is defined as the sum of the terms (d_G(u)d_G(v))/(d_G(u)+d_G(v)) over all edges uv of G, where d_G(u) denotes the degree of ...
Computing Bounds for Second Zagreb Coindex of Sum Graphs
Computing Bounds for Second Zagreb Coindex of Sum Graphs
Topological indices or coindices are one of the graph-theoretic tools which are widely used to study the different structural and chemical properties of the under study networks or...
The Second Hyper-Zagreb Coindex of Chemical Graphs and Some Applications
The Second Hyper-Zagreb Coindex of Chemical Graphs and Some Applications
The second hyper-Zagreb coindex is an efficient topological index that enables us to describe a molecule from its molecular graph. In this current study, we shall evaluate the seco...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Inverse Jacobian and related topics for certain superelliptic curves
Inverse Jacobian and related topics for certain superelliptic curves
Given an elliptic curve E over the complex numbers (CC) given by y^2 = x^3 + ax + b, there exists a lattice L in CC such that the group E(CC) of complex points on E is isomorphic ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...