𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generation and Display of Activity-Weighted Chemical Hyperstructures.

✍ Scribed by Nathan Brown; Peter Willett; David J. Wilton; Richard A. Lewis


Publisher
John Wiley and Sons
Year
2003
Weight
51 KB
Volume
34
Category
Article
ISSN
0931-7597

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Wiener number of vertex-weighted graphs
✍ Sandi KlavΕΎar; Ivan Gutman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 573 KB

The Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of G. If (G,w) is a vertex-weighted graph, then the Wiener number W(G,w) of (G, w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary