Javascript must be enabled to continue!
Computing Topological Indices and Polynomials for Line Graphs
View through CrossRef
A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point, solidness, strain vitality, and so forth, of synthetic mixes. The idea of the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials was set up in the substance diagram hypothesis in light of vertex degrees. These indices are valuable in the investigation of calming exercises of certain compound systems. In this paper, we computed the first and second Zagreb index, the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials of the line graph of wheel and ladder graphs by utilizing the idea of subdivision.
Title: Computing Topological Indices and Polynomials for Line Graphs
Description:
A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections.
All the more vital topological indices correspond to certain physico-concoction properties like breaking point, solidness, strain vitality, and so forth, of synthetic mixes.
The idea of the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials was set up in the substance diagram hypothesis in light of vertex degrees.
These indices are valuable in the investigation of calming exercises of certain compound systems.
In this paper, we computed the first and second Zagreb index, the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials of the line graph of wheel and ladder graphs by utilizing the idea of subdivision.
Related Results
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...
On Convolved Fibonacci Polynomials
On Convolved Fibonacci Polynomials
This work delves deeply into convolved Fibonacci polynomials (CFPs) that are considered generalizations of the standard Fibonacci polynomials. We present new formulas for these pol...
Novel Formulas of Schröder Polynomials and Their Related Numbers
Novel Formulas of Schröder Polynomials and Their Related Numbers
This paper explores the Schröder polynomials, a class of polynomials that produce the famous Schröder numbers when x=1. The three-term recurrence relation and the inversion formula...
MULTIPLE SQUARE SNAKE GRAPHS: THE M - POLYNOMIAL AND SOME DEGREE-BASED TOPOLOGICAL INDICES
MULTIPLE SQUARE SNAKE GRAPHS: THE M - POLYNOMIAL AND SOME DEGREE-BASED TOPOLOGICAL INDICES
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 c...
Some Orthogonal Combinations of Legendre Polynomials
Some Orthogonal Combinations of Legendre Polynomials
The principle objective of this article is to introduce and investigate a type of orthogonal polynomials that are written as combinations of Legendre polynomials. This kind of poly...
New Formulas and Connections Involving Euler Polynomials
New Formulas and Connections Involving Euler Polynomials
The major goal of the current article is to create new formulas and connections between several well-known polynomials and the Euler polynomials. These formulas are developed using...
Truncated-Exponential-Based Appell-Type Changhee Polynomials
Truncated-Exponential-Based Appell-Type Changhee Polynomials
The truncated exponential polynomials em(x) (1), their extensions, and certain newly-introduced polynomials which combine the truncated exponential polynomials with other known pol...
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...

