The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper we characterize the trees which minimize the Wiener index among all trees of given order and maximum degree and the trees which maximize the Wiener index among all trees of given order that have only vertices of two di erent degrees.

objective: diabetes is one of the most common metabolic diseases. earlier diagnosis of diabetes and treatment of hyperglycemia and related metabolic abnormalities is of vital importance. diagnosis of diabetes via proper interpretation of the diabetes data is an important classification problem. classification systems help the clinicians to predict the risk factors that cause the diabetes or pre...

The edge-Wiener index of a connected graph is the sum of the distances between all pairs of edges of the graph. In this paper, we determine the polyphenyl chains with minimum and maximum edge-Wiener indices among all the polyphenyl chains with h hexagons. Moreover, explicit formulas for the edge-Wiener indices of extremal polyphenyl chains are obtained.

An innovative space-time adaptive preprocessing algorithm based on a low complexity multistage nested Wiener filter is introduced. A closed form expression for the Wiener-Hopf filter weights is developed using the multistage nested Wiener falter parameters. It is demonstrated that this algorithm is capable of suppressing both wideband and narrowband jammers while maintaining low complexity.

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.

Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks. Wiener type indices are known to depend both on the network's number of nodes and topology. The Wiener polarity index i...

The reverse Wiener index of a connected graph G is defined as Λ(G) = 1 2 n(n− 1)d−W (G), where n is the number of vertices, d is the diameter, and W (G) is the Wiener index (the sum of distances between all unordered pairs of vertices) of G. We determine the n-vertex non-starlike trees with the first four largest reverse Wiener indices for n > 8, and the nvertex non-starlike non-caterpillar tre...

In this paper, multi-dimensional Wiener-Liu process is proposed. Wiener-Liu process is a type of hybrid process, it corresponds to Brownian motion (Wiener process) in stochastic process and Liu process in fuzzy process. In classical analysis, the basic operations are differential and integral. Correspondingly, Ito-Liu formula plays the role of Ito formula in stochastic process and Liu formula i...

We completely characterize the boundedness on Wiener amalgam spaces of the short-time Fourier transform (STFT), and on both L and Wiener amalgam spaces of a special class of pseudodifferential operators, called localization operators. Precisely, sufficient conditions for the STFT to be bounded on the Wiener amalgam spaces W (L, L) are given and their sharpness is shown. Localization operators a...