| Summary: | Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also known as topological indices, have recently been incorporated as descriptors of complex networks. Among them the Wiener type indices are the most well known and commonly used such descriptors. As one of the fundamental variants of the original Wiener index, the Wiener polarity index has been introduced for a long time and known to be related to the cluster coefficient of networks. In this paper, we consider the value of the Wiener polarity index of lattice networks, a common network structure known for its simplicity and symmetric structure. We first present a simple general formula for computing the Wiener polarity index of any graph. Using this formula, together with the symmetric and recursive topology of lattice networks, we provide explicit formulas of the Wiener polarity index of the square lattices, the hexagonal lattices, the triangular lattices, and the 33 ⋅ 42 lattices. We also comment on potential future research topics.
|
|---|