On the Wiener Index of Graphs
β Scribed by Xiaoying Wu; Huiqing Liu
- Publisher
- Springer Netherlands
- Year
- 2009
- Tongue
- English
- Weight
- 368 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0167-8019
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Eliasi and Taeri [Extension of the Wiener index and Wiener polynomial, Appl. Math. Lett. 21 (2008) 916-921] introduced the notion of y-Wiener index of graphs as a generalization of the classical Wiener index and hyper Wiener index of graphs. They obtained some mathematical properties of this new def
## 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