## 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
β¦ LIBER β¦
Wiener index of some graph operations
β Scribed by Mehdi Eliasi; Ghaffar Raeisi; Bijan Taeri
- Book ID
- 113564780
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 360 KB
- Volume
- 160
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The hyper-Wiener index of graph operatio
β
M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi
π
Article
π
2008
π
Elsevier Science
π
English
β 271 KB
-Wiener index of composite graphs
β
A. Hamzeh; S. Hossein-Zadeh; A.R. Ashrafi
π
Article
π
2011
π
Elsevier Science
π
English
β 218 KB
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
On the Wiener Index of Graphs
β
Xiaoying Wu; Huiqing Liu
π
Article
π
2009
π
Springer Netherlands
π
English
β 368 KB
On the Wiener index of a graph
β
Ante Graovac; TomaΕΎ Pisanski
π
Article
π
1991
π
Springer
π
English
β 396 KB
A Wiener-type graph invariant for some b
β
A.A. Dobrynin; I. Gutman; G. DΓΆmΓΆtΓΆr
π
Article
π
1995
π
Elsevier Science
π
English
β 297 KB
Convex Sets Under Some Graph Operations
β
Sergio R. Canoy, Jr.; I.J.L. Garces
π
Article
π
2002
π
Springer Japan
π
English
β 99 KB