The Wiener index of a connected graph G, denoted by W(G) , is defined as ∑ ( , ) , ∈ ( ) .Similarly, hyper-Wiener index of a connected graph G,denoted by WW(G), is defined as ( ) + ∑ ( , ) , ∈ ( ) .In this paper, we present the explicit formulae for the Wiener, hyper-Wiener and reverse Wiener indices of some graph operations. Using the results obtained here, the exact formulae for Wiener, hyper...

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 is the sum of all pairwise distances of vertices of the graph. Fischermann et al [5] characterized the trees which minimize the Wiener index among all trees with the maximum degree at most ∆. They also determined the trees which maximize the Wiener index, but in a much more restricted family of trees which have two distinct vertex degrees only. In this note, we fully...

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

The Wiener index is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. A long standing conjecture on the Wiener index ([4], [5]) states that for any positive integer n (except numbers from a given 49 element set), one can find a tree with Wiener index n. In this paper, we prove that every i...

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. In [1], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maxim...

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. In [1], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maxim...

In this paper, the concepts of Wiener index of a vertex weighted and edge weighted graphs are discussed. Vertex weight and edge weight of a clique are introduced. Wiener index of a vertex weighted partial cube is also discussed. Also a new concept known as Connectivity index is introduced. A relation between Connectivity index and Wiener index for different graphs are discussed.