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...

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...

In this paper, we consider a molecular descriptor called the Wiener polarity index, which is defined as the number of unordered pairs of vertices at distance three in a graph. Molecular descriptors play a fundamental role in chemistry, materials engineering, and in drug design since they can be correlated with a large number of physico-chemical properties of molecules. As the main result, we de...

Among various topological indices considered in chemical graph theory, only a few have been widely studied in mathematical and chemical literatures. However, it seems that less attention has been paid to the Wiener polarity index. It was introduced by Harold Wiener1 for acyclic molecules in 1947. The Wiener polarity index of an organic molecule the molecular graph of which is G = (V,E) is defin...

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3. The trees and unicyclic graphs...