Let G be a simple connected graph and di be the degree of its ith vertex. In a recent paper [D. Vukičević, B. Furtula, Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges, J. Math. Chem. 46 (2009) 1369–1376] the ‘‘first geometric–arithmetic index’’ of a graph Gwas defined as GA1 = − di dj (di + dj)/2 with summation going over all pairs of ...

the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...

Topological indices are the mathematical tools that correlate the chemical structure with various physical properties, chemical reactivity or biological activity numerically. A topological index is a function having a set of graphs as its domain and a set of real numbers as its range. In QSAR/QSPR study, a prediction about the bioactivity of chemical compounds is made on the basis of physico-ch...

The Wiener index, denoted byW (G), of a connected graph G is the sum of all pairwise distances of vertices of the graph, that is, W (G) = 1 2 ∑ u,v∈V (G) d(u, v). In this paper, we obtain the Wiener index of the tensor product of a path and a cycle.

A topological index is a numerical value that describes the entire structure of chemical compound’s molecular graph and aids in understanding its physical properties, reactivities, boiling activities. In theory, these indices are instrumental quantifying various properties compounds such as SiO4. The selection SiO4 this work an important aspect because structural flexibility, easy availability,...

The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...

Consider the set SG(Qk) of all graphs whose vertices are labeled with non-identity elements of the group Qk = Z2 so that there is an edge between vertices with labels a and b if and only if the vertex labeled a + b is also in the graph. Note that edges always appear in triangles, since a + b = c, b + c = a and a + c = b are equivalent statements for Qk. We define the random cubic sum graph SG(Q...