๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the variable Wiener indices of trees with given maximum degree

โœ Scribed by Muhuo Liu; Bolian Liu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
509 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Wiener indices of trees and monocyclic g
Wiener indices of trees and monocyclic graphs with given bipartition
โœ Zhibin Du ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB

## Abstract The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener in

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
โœ Y. Caro; I. Krasikov; Y. Roditty ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB ๐Ÿ‘ 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__ฮด(__G__) + 1, where ฮด(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als

The maximum Wiener polarity index of tre
The maximum Wiener polarity index of trees with pendants
โœ Hanyuan Deng; Hui Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

The Wiener polarity index W p (G) of a graph G = (V , E) is the number of unordered pairs of vertices {u, v} of G such that the distance d G (u, v) between u and v is 3. In this work, we give the maximum Wiener polarity index of trees with n vertices and k pendants and find that the maximum value is