For a graph G , we denote by N ( ) the number of non-empty subtrees . If is connected, its Wiener index W sum distances between all unordered pairs vertices In this paper establish some comparative results and It shown that > if order n ≥ 7 diameter 2 or 3. Also graphs are constructed with large diameters Moreover, for tree T ≇ S prove starlike maximum degree 3 exactly two degrees one which ...

In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order n with girth and the matching number β ≥ 3g 2 . Moreover, we characterize all extremal graphs which attain the lower bound.

The Wiener number W (G) of a graph G is the sum of distances between all pairs of vertices of G. If (G,w) is a vertex-weighted graph, then the Wiener number W (G,w) of (G,w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary Hamming graph, a formula is given for computing W (G,w) in terms of a binary Hamming labeling o...

in theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. among them wiener, szeged and detour indices play significant roles in anticipating chemical phenomena. in the present paper, we study these topological indices with respect to their difference number.

whereas there is an exact linear relation between the wiener indices of kenograms and plerograms of isomeric alkanes, the respective terminal wiener indices exhibit a completely different behavior: correlation between terminal wiener indices of kenograms and plerograms is absent, but other regularities can be envisaged. in this article, we analyze the basic properties of terminal wiener indices...

The Tauberian theorem of Wiener and Ikehara provides the most direct way to the prime number theorem. Here it is shown how Newman’s contour integration method can be adapted to establish the Wiener–Ikehara theorem. A simple special case suffices for the PNT. But what about the twin-prime problem?

In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.

We systematically develop real Paley–Wiener theory for the Fourier transform on Rd for Schwartz functions, Lp-functions and distributions, in an elementary treatment based on the inversion theorem. As an application, we show how versions of classical Paley–Wiener theorems can be derived from the real ones via an approach which does not involve domain shifting and which may be put to good use fo...

We study distance-based graph invariants, such as the Wiener index, the Szeged index, and variants of these two. Relations between the various indices for trees are provided as well as formulas for line graphs and product graphs. This allows us, for instance, to establish formulas for the edge Wiener index of Hamming graphs, C4nanotubes and C4-nanotori. We also determine minimum and maximum of ...