Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

MULTIPLE SQUARE SNAKE GRAPHS: THE M - POLYNOMIAL AND SOME DEGREE-BASED TOPOLOGICAL INDICES

View through CrossRef
The computation of topological indices of graphs is a topic of current interest to many researchers since they are parameters which quantify the physio-chemical properties of the chemical graphs.  The concept of M - polynomial of a graph G was introduced by Emeric Deutsch and Sandi Klavzar in 2015 as an effective tool to compute a closed formula for any such index for a given family of graphs. In this paper, the M - polynomial for the class of Multiple square snake graphs M_m (C_(4,n))  is calculated, which is then utilised to find the values of many degree based topological indices. Also, as additional results, the values of these topological indices for Square snake graphs, Double square snake graphs and Triple square snake graphs, which are special cases of the Multiple square snake graphs, are also enumerated. Topological indices are used as descriptors in QSPR/QSAR models and they help predict properties such as boiling point, stability, solubility, biological activity, toxicity, etc., without the need for experimental testing. Also, by means of these numbers, instead of handling large and complicated molecular structures, chemists can work with indices that summarize structural features. This makes mathematical modeling and comparison between molecules much easier.
Title: MULTIPLE SQUARE SNAKE GRAPHS: THE M - POLYNOMIAL AND SOME DEGREE-BASED TOPOLOGICAL INDICES
Description:
The computation of topological indices of graphs is a topic of current interest to many researchers since they are parameters which quantify the physio-chemical properties of the chemical graphs.
  The concept of M - polynomial of a graph G was introduced by Emeric Deutsch and Sandi Klavzar in 2015 as an effective tool to compute a closed formula for any such index for a given family of graphs.
In this paper, the M - polynomial for the class of Multiple square snake graphs M_m (C_(4,n))  is calculated, which is then utilised to find the values of many degree based topological indices.
Also, as additional results, the values of these topological indices for Square snake graphs, Double square snake graphs and Triple square snake graphs, which are special cases of the Multiple square snake graphs, are also enumerated.
Topological indices are used as descriptors in QSPR/QSAR models and they help predict properties such as boiling point, stability, solubility, biological activity, toxicity, etc.
, without the need for experimental testing.
Also, by means of these numbers, instead of handling large and complicated molecular structures, chemists can work with indices that summarize structural features.
This makes mathematical modeling and comparison between molecules much easier.

Related Results

Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Identification of Morphological Characteristics of Sidimpuan Snake Fruit (Salacca sumatrana Becc.)
Identification of Morphological Characteristics of Sidimpuan Snake Fruit (Salacca sumatrana Becc.)
Sidimpuan snake fruit (Salacca sumatrana Becc.) plants have several varieties, one of which has a distinctive feature in the taste and colour of the fruit flesh. The results of the...
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...
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...
Topological Descriptors on Some Families of Graphs
Topological Descriptors on Some Families of Graphs
In view of the successful applications of graph theory, relationships between the biological activity and chemical structure have been developed. One of the popular topics in graph...
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex...
On Hosoya Polynomial and Subsequent Indices of C4C8(R) and C4C8(S) Nanosheets
On Hosoya Polynomial and Subsequent Indices of C4C8(R) and C4C8(S) Nanosheets
Chemical structures are mathematically modeled using chemical graphs. The graph invariants including algebraic polynomials and topological indices are related to the topological st...
Computation of Topological Indices of Some Special Graphs
Computation of Topological Indices of Some Special Graphs
There are several chemical indices that have been introduced in theoretical chemistry to measure the properties of molecular topology, such as distance-based topological indices, d...

Back to Top