Generalizations of Wiener polarity index and terminal Wiener index

preprint2012arXivOpen access

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)W_k (G) as the number of unordered pairs of vertices u,v{u, v} of GG such that the shortest distance d(u,v)d (u, v) between uu and vv is kk (this is actually the kk-th coefficient in the Wiener polynomial). For k=3k = 3, we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index TWk(G)TW_k (G) as the sum of distances between all pairs of vertices of degree kk. For k=1k = 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 nn.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.