The symmetric division degree (SDD) index is one the 148 discrete Adriatic indices,introduced by Vukicevi´c et al. as a remarkable predictor of total surface area of polychlorobiphenyls.The SDD index has already been proved ...

Fullerenes are polyhedral molecules made of carbon atoms. These graphs have attracted much attention in the chemical and the mathematical literature. In the present paper, we investigate problems concerned with the eigenvalues ...

Let G be a graph, the distance d(u,v) between two vertices u and v of G is the minimumlength of the paths connecting them. The aim of this paper is computing the distance matrix of infinite familiy of fullerene graph A10n.

One of the most important ideas employed in chemical graph theory is that of so-called topological indices. This is to associate a numerical value with a graph structure that often has some kind of correlation ...

A molecular graph is hydrogen depleted chemical structure in which vertices denote atoms and edges denote the bonds. Nanostar dendrimers, a type of chemical compound, have potential in fields such as chemistry, nanotechnology, ...

In the study of QSPR/QSAR, topological indices such as Zagreb index, Randic index, atom-bond connectivity index are exploited to estimate the bioactivity of chemical compounds. Inspired by many degree based topological ...

Let G be a graph, the distance d(u

The energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the eigen values of G. In this paper, we introduce some in-equalities of energy of graphs.

We exhibit a polynomial time algorithm that computes the Clar number of any nanotube. This algorithm can be easily extended to one that computes the Clar number of fullerene whose pentagon-clusters are all of even size.