Modified Eccentric Connectivity of Generalized Thorn Graphs

The thorn graph GT of a given graph G is obtained by attaching t(>0) pendent vertices to each vertex of G. The pendent edges, called thorns of GT, can be treated as P2 or K2, so that a thorn graph is generalized by replacing P2 by Pm and K2 by Kp and the respective generalizations are denoted by GPm and GKp. The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph in a hydrogen suppressed molecular structure. In this paper, we give the modified eccentric connectivity index and the concerned polynomial for the thorn graph GT and the generalized thorn graphs GKp and GPm.

Download Full-text

On eccentricity-based topological descriptors of water-soluble dendrimers

Zeitschrift für Naturforschung C ◽

10.1515/znc-2018-0123 ◽

2018 ◽

Vol 74 (1-2) ◽

pp. 25-33 ◽

Cited By ~ 11

Author(s):

Zahid Iqbal ◽

Muhammad Ishaq ◽

Adnan Aslam ◽

Wei Gao

Keyword(s):

Molecular Structure ◽

Chemical Properties ◽

Topological Indices ◽

Water Soluble ◽

Connectivity Index ◽

Topological Descriptors ◽

Physical And Chemical Properties ◽

Eccentric Connectivity Index ◽

Physical And Chemical ◽

And Chemical Properties

AbstractPrevious studies show that certain physical and chemical properties of chemical compounds are closely related with their molecular structure. As a theoretical basis, it provides a new way of thinking by analyzing the molecular structure of the compounds to understand their physical and chemical properties. The molecular topological indices are numerical invariants of a molecular graph and are useful to predict their bioactivity. Among these topological indices, the eccentric-connectivity index has a prominent place, because of its high degree of predictability of pharmaceutical properties. In this article, we compute the closed formulae of eccentric-connectivity–based indices and its corresponding polynomial for water-soluble perylenediimides-cored polyglycerol dendrimers. Furthermore, the edge version of eccentric-connectivity index for a new class of dendrimers is determined. The conclusions we obtained in this article illustrate the promising application prospects in the field of bioinformatics and nanomaterial engineering.

Download Full-text

Eccentric Connectivity Index of Molecular Grapgs of Chemical Trees with Application to Alkynes

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2016.5615 ◽

2016 ◽

Vol 13 (10) ◽

pp. 6694-6697 ◽

Cited By ~ 1

Author(s):

R. S Haoer ◽

K. A Atan ◽

A. M Khalaf ◽

M. R. Md Said ◽

R Hasni

Keyword(s):

Molecular Structure ◽

Mathematical Modelling ◽

Biological Activities ◽

Molecular Graph ◽

Connectivity Index ◽

Chemical Bonds ◽

Eccentric Connectivity Index ◽

Degree Of A Vertex ◽

Structure Descriptor ◽

Chemical Trees

Let G = (V,E) be a simple connected molecular graph. The eccentric connectivity index ξ(G) is a distance–based molecular structure descriptor that was recently used for mathematical modelling of biological activities of diverse nature. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V = V(G) and E = E(G), respectively. If d(u,v) be the notation of distance between vertices u,v ∈ V and is defined as the length of a shortest path connecting them. Then, the eccentricity connectivity index of a molecular graph Gis defined as ξ(G) = Σv∈V(G) deg(V)ec(V), where deg(V) (or simply dv) is degree of a vertex V ∈ V(G), and is defined as the number of adjacent vertices with V. ec(V) is defined as the length of a maximal path connecting to another vertex of v. In this paper, we establish the general formulas for the eccentricity connectivity index of molecular graphs classes of chemical trees with application to alkynes.

Download Full-text