The symmetric division degree $SDD$-index of a simple connected graph $G$ is defined as the sum of terms $f(d_u,d_v)=(d_u/d_v)+(d_v/d_u)$ over all pairs of distinct adjacent vertices of $G$; where $d_u$ denotes the degree ...

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

Using density functional theory calculations, we investigated properties of a functionalized carbon nanotube with one mercarzole molecule as a benzimidazole fungicide. Three different configurations are possible depending ...

In this paper, we study the edge version of some degree based topological indices such as general sum-connectivity index, Randic index, inverse sum indeg index, symmetric division deg index, augmenting Zagreb index and ...

A topological index is a numerical invariant associated with a chemical graph. In this paper we introduce some GAP programs for computing well-known topological indices.