The Wiener number [Formula: see text] of a graph [Formula: see text] was introduced by Harold Wiener in connection with the modeling of various physic-chemical, biological and pharmacological properties of organic molecules in chemistry. Milan Randić introduced a modification of the Wiener index for trees (acyclic graphs), and it is known as the hyper-Wiener index. Then Klein et al. generalized Randić’s definition for all connected (cyclic) graphs, as a generalization of the Wiener index, denoted by [Formula: see text] and defined as [Formula: see text]. In this paper, we establish some upper and lower bounds for [Formula: see text], in terms of other graph-theoretic parameters. Moreover, we compute hyper-Wiener number of some classes of graphs.
Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs
