Javascript must be enabled to continue!
Computing Bounds for Second Zagreb Coindex of Sum Graphs
View through CrossRef
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 graphs in the subject of computer science and chemistry, respectively. For these investigations, the operations of graphs always played an important role for the study of the complex networks under the various topological indices or coindices. In this paper, we determine bounds for the second Zagreb coindex of a well-known family of graphs called
F
-sum (
S
-sum,
R
-sum,
Q
-sum, and
T
-sum) graphs in the form of Zagreb indices and coindices of their factor graphs, where these graphs are obtained by using four subdivision-related operations and Cartesian product of graphs. At the end, we illustrate the obtained results by providing the exact and bonded values of some specific
F
-sum graphs.
Title: Computing Bounds for Second Zagreb Coindex of Sum Graphs
Description:
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 graphs in the subject of computer science and chemistry, respectively.
For these investigations, the operations of graphs always played an important role for the study of the complex networks under the various topological indices or coindices.
In this paper, we determine bounds for the second Zagreb coindex of a well-known family of graphs called
F
-sum (
S
-sum,
R
-sum,
Q
-sum, and
T
-sum) graphs in the form of Zagreb indices and coindices of their factor graphs, where these graphs are obtained by using four subdivision-related operations and Cartesian product of graphs.
At the end, we illustrate the obtained results by providing the exact and bonded values of some specific
F
-sum graphs.
Related Results
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...
Inverse sum indeg coindex of graphs
Inverse sum indeg coindex of graphs
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...
Zagreb Radio Indices and Coindices
Zagreb Radio Indices and Coindices
Zagreb radio index or coindex of a graph is defined based on the optimal radio labelling of the graph, where optimal refers to the labeling with a span equal to the radio number of...
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...
A Statistical Comparison between Zagreb indices for correlation with toxicity predictions of natural products
A Statistical Comparison between Zagreb indices for correlation with toxicity predictions of natural products
Graph theory had wide applications in developing in silico tools and it is widely used to calculate topological indices to establish structural activity relations of chemicals/comp...
Hyper Zagreb indices of composite graphs
Hyper Zagreb indices of composite graphs
For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the degrees of vertices, and the second Zagreb index M2 is equal to the sum of the products of ...
The Second Hyper-Zagreb Index and Coindex of Chemical Nano-structures in Drugs
The Second Hyper-Zagreb Index and Coindex of Chemical Nano-structures in Drugs
Abstract
The various dendrimer nanoparticles have properties like multivalency, controlled size, and surface functionality that make them promising nanocarriers for targete...
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...

