On the generalized Wiener polarity index for some classes of graphs
Halina Bielak, Kinga Dąbrowska, Katarzyna Wolska
DOI: http://dx.doi.org/10.15439/2015F340
Citation: Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 5, pages 483–487 (2015)
Abstract. The generalized Wiener polarity index Wk(G) of a graph G = (V;E) is defined as a number of unordered pairs fu; vg of G such that the shortest distance between u and v is equal to k: Wk(G) = jffu; vg; d(u; v) = k; u; v 2 V gj In this paper we give some results for 2-trees in case of mentioned index. We present an infinite family of 2-trees with maximum value of generalized Wiener polarity index.