The Wiener index of a graph G, denoted W(G), is the sum distances between all non-ordered pairs vertices in G.É. Czabarka, et al. conjectured that for simple quadrangulation G on n vertices, n?4, W(G)?112n3+76n?2,n?0(mod2), 112n3+1112n?1,n?1(mod2).In this paper, we confirm conjecture.

The Wiener index of a graph G is equal to the sum of distances between all pairs of vertices of G, It is known that the Wiener index of a molecular graph correlates with certain physical and chemical properties of a molecule. In the mathematical literature, many good algorithms can be found to eompute the distances m a graph, and these can easily be adapted for the caleulation of the Wiener ind...

Motivated by the terminal Wiener index‎, ‎we define the Ashwini index $mathcal{A}$ of trees as‎ begin{eqnarray*}‎ % ‎nonumber to remove numbering (before each equation)‎ ‎mathcal{A}(T) &=& sumlimits_{1leq i

let g be a connected simple (molecular) graph. the distance d(u, v) between two vertices u and v of g is equal to the length of a shortest path that connects u and v. in this paper we compute some distance based topological indices of h-phenylenic nanotorus. at first we obtain an exactformula for the wiener index. as application we calculate the schultz index and modified schultz index of this ...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

The Wiener index, W , is the sum of distances between all pairs of vertices in a graph G. The quadratic line graph is defined as L(L(G)), where L(G) is the line graph of G. A generalized star S is a tree consisting of ∆ ≥ 3 paths with the unique common endvertex. A relation between the Wiener index of S and of its quadratic graph is presented. It is shown that generalized stars having the prope...

Let G be a graph. Denote by L(G) its i-iterated line graph and denote by W (G) its Wiener index. There is a conjecture which claims that there exists no nontrivial tree T and i ≥ 3, such that W (L(T )) = W (T ), see [5]. We prove this conjecture for trees which are not homeomorphic to the claw K1,3 and the graph of letter H.

A simpliied way of deriving of realizable and explicit Wiener lters is presented. Discrete time problems are discussed, in a polynomial equation framework. Optimal lters, predictors and smoothers are calculated by means of spectral factorizations and linear polynomial equations. A new tool for obtaining these equations, for a given problem structure, is described. It is based on evaluation of o...