The Wiener indexW (G) of a connected graphG is defined to be the sum ∑ u,v d(u, v) of the distances between the pairs of vertices in G. Similarly, the edge-Wiener index We(G) of G is defined to be the sum ∑ e,f d(e, f) of the distances between the pairs of edges in G, or equivalently, the Wiener index of the line graph L(G). Finally, the Gutman index Gut(G) is defined to be the sum ∑ u,v deg(u)...

Abstract We prove a moment identity on the Wiener space that extends the Skorohod isometry to arbitrary powers of the Skorohod integral on the Wiener space. As simple consequences of this identity we obtain sufficient conditions for the Gaussianity of the law of the Skorohod integral and a recurrence relation for the moments of second order Wiener integrals. We also recover and extend the suffi...

Polynomial interpolation can be used to obtain closed formulas for topological indices of infinite series of molecular graphs. The method is discussed and its advantages and limitations are pointed out. This is illustrated on fullerenes C12k+4 and four topological indices: the Wiener index, the edge Wiener index, the eccentric connectivity index, and the reverse Wiener index. The results for th...

The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. We call such a graph, which is derived from a chemical compound, a molecular graph. Evidence shows that the vertex-weighted Wiener number, which is defined over this molecular graph, is ...

where x̄ is the complex conjugate of x This paper uses the machinery of almost periodic functions to prove that even without uniform convergence the connection between a pair of almost periodic functions and the constants of the associated Fourier series exists for both the convolution and cross-correlation. The general results for two almost periodic functions are narrowed and applied to Ramanu...