The eccentric connectivity index of polycyclic aromatic hydrocarbons (PAHs)

Alaeiyan, Mehdi; Natarajan, C.; Sathiamoorthy, G.

doi:10.33945/sami/ecc.2020.6.1

Cited by 5 publications

(3 citation statements)

References 7 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Study of graph has some programs of various topological indices in quantitative structure-activity relationship (QSAR) and quantitative structure-property relationship (QSPR), digital screenings, and computational drug designing citations as shown in [1,2]. us far, several exclusive topological indices have been established, and maximum of them are most effective graph descriptors in [3,4]; apart, some indices have proven their parallel with organic, chemical, or physical residences of secure molecules in [5][6][7][8][9][10][11][12][13][14][15][16][17].…”

Section: Application Backgroundmentioning

confidence: 99%

“…Within the factors of degreebased topological indices, we compete necessary role of M-polynomial. Readers can refer to [9][10][11][12][13][14][15][16][17][27][28][29][30][31][32][33][34][35]. It is the foremost general progressive polynomial and an additionally closed formula alongside 10 distance-based topological indices is given by M-polynomial.…”

Section: Application Backgroundmentioning

confidence: 99%

See 1 more Smart Citation

M-Polynomials and Degree-Based Topological Indices of the Molecule Copper(I) Oxide

Chaudhry

Shoukat

Afzal

et al. 2021

Journal of Chemistry

Self Cite

View full text Add to dashboard Cite

Topological indices are numerical parameters used to study the physical and chemical residences of compounds. Degree-based topological indices have been studied extensively and can be correlated with many properties of the understudy compounds. In the factors of degree-based topological indices, M-polynomial played an important role. In this paper, we derived closed formulas for some well-known degree-based topological indices like first and second Zagreb indices, the modified Zagreb index, the symmetric division index, the harmonic index, the Randić index and inverse Randić index, and the augmented Zagreb index using calculus.

show abstract

Section: Application Backgroundmentioning

confidence: 99%

Section: Application Backgroundmentioning

confidence: 99%

M-Polynomials and Degree-Based Topological Indices of the Molecule Copper(I) Oxide

Chaudhry

Shoukat

Afzal

et al. 2021

Journal of Chemistry

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many topological indices have been used to characterize molecular graphs and many of these indices are good graph descriptors [3,4]. Furthermore, several of these indices have been discovered to correspond well with the organic, chemical, or physical characteristics of molecules [5][6][7][8][9][10][11][12][13][14][15][16][17]. As a result, they serve an important role in understanding and predicting molecular behavior and characteristics in a variety of chemical and pharmacological situations.…”

Section: Introductionmentioning

confidence: 99%

Algebraic Structure Graphs over the Commutative Ring Zm: Exploring Topological Indices and Entropies Using M-Polynomials

Alali,

Ali,

Hassan

et al. 2023

Mathematics

View full text Add to dashboard Cite

The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from abstract algebra, which deals with algebraic structures such as groups, rings, and fields. If the vertex set of a graph G^ is fully made up of the zero divisors of the modular ring Zn, the graph is said to be a zero-divisor graph. If the products of two vertices are equal to zero under (modn), they are regarded as neighbors. Entropy, a notion taken from information theory and used in graph theory, measures the degree of uncertainty or unpredictability associated with a graph or its constituent elements. Entropy measurements may be used to calculate the structural complexity and information complexity of graphs. The first, second and second modified Zagrebs, general and inverse general Randics, third and fifth symmetric divisions, harmonic and inverse sum indices, and forgotten topological indices are a few topological indices that are examined in this article for particular families of zero-divisor graphs. A numerical and graphical comparison of computed topological indices over a proposed structure has been studied. Furthermore, different kinds of entropies, such as the first, second, and third redefined Zagreb, are also investigated for a number of families of zero-divisor graphs.

show abstract