Let Sz(G), Sz(G) and W (G) be the Szeged index, revised Szeged index and Wiener index of a graph G. In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order n > 10 are characterized; and the graphs with the first, second, third, and fourth largest Wiener indices among all bicyclic graphs are identified. Based on these results...

Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.

The Wiener index is the sum of distances between all pairs of vertices in a connected graph. In this paper, explicit expressions for the expected value of the Wiener index of three types of random pentagonal chains (cf. Figure 1) are obtained.

The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.

a lot of research and various techniques have been devoted for finding the topologicaldescriptor wiener index, but most of them deal with only particular cases. there exist threeregular plane tessellations, composed of the same kind of regular polygons namely triangular,square, and hexagonal. using edge congestion-sum problem, we devise a method to computethe wiener index and demonstrate this m...

Abstract. A subgraph H of a graph G is gated if for every x ∈ V (G) there exists a vertex u in H such that dG(x, v) = dG(x, u) + dG(u, v) for any v ∈ V (H). The gated amalgam of graphs G1 and G2 is obtained from G1 and G2 by identifying their isomorphic gated subgraphs H1 and H2. Two theorems on the Wiener index of gated amalgams are proved. Several known results on the Wiener index of (chemica...

Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...

Let G be a simple graph with vertex set and edge set . The function which assigns to each pair of vertices in , the length of minimal path from to , is called the distance function between two vertices. The distance function between and edge and a vertex is where for and. , . The Wiener index of a graph is denoted by and is defined by .In general this kind of index is called a topological index...

The Wiener index of a connected graph G, denoted by W (G), is defined as 12 ∑ u,v∈V (G) dG(u, v). Similarly, the hyper-Wiener index of a connected graph G, denoted by WW (G), is defined as 1 2W (G) + 1 4 ∑ u,v∈V (G) dG(u, v). The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, ...