For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...

The Wiener Index, or the Wiener Number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener Index for trees, and Ivan Gutman proposed a modification of the Schultz index with...

We establish the various relationships that exist among the integral transform Ᏺ α,β F , the convolution product (F * G) α , and the first variation δF for a class of functionals defined on K[0,T ], the space of complex-valued continuous functions on [0,T ] which vanish at zero. 1. Introduction and definitions. In a unifying paper [10], Lee defined an integral transform Ᏺ α,β of analytic functi...

Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks, such as the R package QuACN. Wiener type indices are known to depe...

This paper communicates a novel method of Wiener filtering signals from scientific instruments to reduce their noise content. The main prerequisite for the applicability of this technique is that the pure (i.e. noiseless) signal is reproducible, a condition that is satisfied by a wide range of experimental measurements. The benefits of this Wiener filter design approach are its simplicity, gene...

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

This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...

The Wiener filter is analyzed for stationary complex Gaussian signals from an information-theoretic point of view. A dual-port analysis of the Wiener filter leads to a decomposition based on orthogonal projections and results in a new multistage method for implementing the Wiener filter using a nested chain of scalar Wiener filters. This new representation of the Wiener filter provides the capa...

Wiener filter is widely used for image denoising and restoration. It is alternatively known as the minimum mean square error filter or the least square error filter, since the objective function used in Wiener filter is an age-old benchmark called the Mean Square Error (MSE). Wiener filter tries to approximate the degraded image so that its objective function is optimized. Although MSE is consi...