fullerenes are closed−cage carbon molecules formed by 12 pentagonal and n/2 – 10hexagonal faces, where n is the number of carbon atoms. patrick fowler in his lecture inmcc 2009 asked about the wiener index of fullerenes in general. in this paper werespond partially to this question for an infinite class of fullerenes with exactly 10ncarbon atoms. our method is general and can be applied to full...

The problem of distances in a graph, G, is one of the most studied questions, both from theoretical point of view and applications (the reader can consult two recent reviews ). It is connected to the Wiener number, W, or "the path number" as denominated by its initiator. In acyclic structures, Wiener number and its extension, hyper-Wiener number, can be defined as edge/path contributions, Ie/p ...

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. in theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. the wiener polarity index ...

In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalizedWiener polarity indexWk(G) as the number of unordered pairs of vertices {u, v} of G such that the shortest distance d(u, v) between u and v is k. For k = 3, we get standard Wiener polarity index. ...

hansen et‎. ‎al.‎, ‎using the autographix software ‎package‎, ‎conjectured that the szeged index $sz(g)$ and the‎ ‎wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq ‎4$ vertices and $m geq n$ edges‎, ‎obeys the relation‎ ‎$sz(g)-w(g) geq 4n-8$‎. ‎moreover‎, ‎this bound would be the best possible‎. ‎this paper offers a proof to this conjecture‎.

One of the most widely known topological index is the Wiener index. The Wiener Index Conjecture states that all positive integer numbers except a finite set are the Wiener indices of some trees. We explore the Wiener indices of the binary trees. We present efficient algorithms for generating the Wiener indices of the binary trees. Based on experiments we strengthen the conjecture for the class ...

reliability wiener number is a modification of the original wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

An algorithm for the calculation of the hyper-Wiener index (WW) of benzenoid hydrocarbons (both cata- and pericondensed) is described, based on the consideration of pairs of elementary cuts of the corresponding benzenoid graph B. A pair of elementary cuts partitions the vertices of B into four classes. WW is expressed as a sum of terms of the form n11n22 + n12n21, each associated with a pair of...