Generalizations of Wiener polarity index and terminal Wiener index

From MaRDI portal
Publication:367047

DOI10.1007/S00373-012-1215-6zbMATH Open1272.05039arXiv1106.2986OpenAlexW2089482534MaRDI QIDQ367047FDOQ367047


Authors: Aleksandar Ilić, Milovan Ilić Edit this on Wikidata


Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalized Wiener polarity index Wk(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 (this is actually the k-th coefficient in the Wiener polynomial). For k=3, we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index TWk(G) as the sum of distances between all pairs of vertices of degree k. For k=1, we get standard terminal Wiener index. In this paper we describe a linear time algorithm for computing these indices for trees and partial cubes, and characterize extremal trees maximizing the generalized Wiener polarity index and generalized terminal Wiener index among all trees of given order n.


Full work available at URL: https://arxiv.org/abs/1106.2986




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Generalizations of Wiener polarity index and terminal Wiener index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367047)