the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...

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 topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.

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...

Investigation of asymptotic properties of a statistical estimator or of a testing statistic often leads to a linear transformation of a Wiener process that born a Wiener process or a Brownian bridge. Let us recall some typical examples of such transformations. Provided a Wiener process (W(t) , £ > 0) the processes (^W(a • t) ,t > 0), a T-: 0 and (tW(\) , £ > 0) are Wiener processes and (W(t) tW...

Image and video signals are sometimes corrupted by Gaussian noise. Wiener ltering could reduce noise eeectively. Wiener lter is the best linear restoration lter in the sense of mean square error (MSE). In this project, Wiener lters were implemented to reduce noise in noisy images and video sequences. The lter taps of Wiener lter adapt with local signal and noise statistics. This report has four...

let g and h be two graphs. the corona product g o h is obtained by taking one copy of gand |v(g)| copies of h; and by joining each vertex of the i-th copy of h to the i-th vertex of g,i = 1, 2, …, |v(g)|. in this paper, we compute pi and hyper–wiener indices of the coronaproduct of graphs.