𝔖 Bobbio Scriptorium
✦   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

## 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

-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
Convex Sets Under Some Graph Operations
✍ Sergio R. Canoy, Jr.; I.J.L. Garces πŸ“‚ Article πŸ“… 2002 πŸ› Springer Japan 🌐 English βš– 99 KB