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
β¦ LIBER β¦
A Class of Trees and its Wiener Index
β Scribed by Stephan G. Wagner
- Publisher
- Springer Netherlands
- Year
- 2006
- Tongue
- English
- Weight
- 315 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0167-8019
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The maximum Wiener polarity index of tre
β
Hanyuan Deng; Hui Xiao
π
Article
π
2010
π
Elsevier Science
π
English
β 327 KB
A note on a formula for the hyper-Wiener
β
IstvΓ‘n Lukovits
π
Article
π
1995
π
Elsevier Science
π
English
β 438 KB
The Average Widths of SobolevβWiener Cla
β
Gui Qiao Xu; Yong Ping Liu1)
π
Article
π
2004
π
Institute of Mathematics, Chinese Academy of Scien
π
English
β 212 KB
Extension of the Wiener index and Wiener
β
Mehdi Eliasi; Bijan Taeri
π
Article
π
2008
π
Elsevier Science
π
English
β 274 KB
Determination of the Wiener molecular br
β
E. R. Canfield; R. W. Robinson; D. H. Rouvray
π
Article
π
1985
π
John Wiley and Sons
π
English
β 928 KB
The many applications of the distance matrix, D(G), and the Wiener branching index, W(G), in chemistry are briefly outlined. W(G) is defined as one half the sum of all the entries in D(G). A recursion formula is developed enabling W(G) to be evaluated for any molecule whose graph G exists in the for
New theorem for the wiener molecular bra
β
I. Gutman; D.H. Rouvray
π
Article
π
1990
π
Elsevier Science
π
English
β 347 KB