How to compute the Wiener index of a graph
✍ Scribed by Bojan Mohar; Toniaž Pisanski
- Publisher
- Springer
- Year
- 1988
- Tongue
- English
- Weight
- 514 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Graph operations C 4 nanotube C 4 nanotorus q-multi-walled nanotube a b s t r a c t Let G be a graph. The distance d(u, v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between verti
The kth power of a graph G, denoted by G k , is a graph with the same vertex set as G such that two vertices are adjacent in G k if and only if their distance is at most k in G. The Wiener index is a distance-based topological index defined as the sum of distances between all pairs of vertices in a
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some