Abstract. In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent
Abstract-The generalized Wiener polarity index W k (G) of a graph G = (V, E) is defined as a number of unordered pairs {u, v} of G such that the shortest distance between u and v is equal to k: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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.