It is a known fact that the Wiener index (i.e. the sum of all distances between pairs of vertices in a graph) of a tree with an odd number of vertices is always even. In this paper, we consider the distribution of the Wiener index and the related tree parameter “internal path length” modulo 2 by means of a generating functions approach as well as by constructing bijections for plane trees.

TheWiener polarity indexWp(G) of a graphG of order n is the number of unordered pairs of vertices u and v of G such that the distance dG(u, v) between u and v is 3. In this paper the Wiener polarity index of some graph operations are computed. As an application of our results, the Wiener polarity index of a polybuckyball fullerene and C4 nanotubes and nanotori are computed. AMS Mathematics Subj...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some common graphs. We then find a formula for the Wiener polynomial of a dendrimer, a certain highly...

The Wiener index of a connected graph G, denoted by W(G) , is defined as ∑ ( , ) , ∈ ( ) .Similarly, hyper-Wiener index of a connected graph G,denoted by WW(G), is defined as ( ) + ∑ ( , ) , ∈ ( ) .In this paper, we present the explicit formulae for the Wiener, hyper-Wiener and reverse Wiener indices of some graph operations. Using the results obtained here, the exact formulae for Wiener, hyper...

In this paper, we combine the well-established technique of Wiener filtering with an efficient method for robust smoothing: channel smoothing. The main parameters to choose in channel smoothing are the number of channels and the averaging filter. Whereas the number of channels has a natural lower bound given by the noise level and should for the sake of speed be as small as possible, the averag...

the unitary cayley graph xn has vertex set zn = {0, 1,…, n-1} and vertices u and v areadjacent, if gcd(uv, n) = 1. in [a. ilić, the energy of unitary cayley graphs, linear algebraappl. 431 (2009) 1881–1889], the energy of unitary cayley graphs is computed. in this paperthe wiener and hyperwiener index of xn is computed.

This paper analyzes the computational complexity of set membership identification of Hammerstein and Wiener systems. Its main results show that, even in cases where a portion of the plant is known, the problems are generically NP-hard both in the number of experimental data points and in the number of inputs (Wiener) or outputs (Hammerstein) of the nonlinearity. These results provide new insigh...

Type synthesis of 1-DOF remote center of motion (RCM) mechanisms is the preliminary for research on many multiDOF RCM mechanisms. Since types of existing RCM mechanisms are few, it is necessary to find an efficient way to create more new RCM mechanisms. In this paper, existing 1-DOF RCM mechanisms are first classified, then base on a proposed concept of the planar virtual center (VC) mechanism,...