𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Wiener index of a graph

✍ Scribed by Ante Graovac; Tomaž Pisanski

Publisher
Springer
Year
1991
Tongue
English
Weight
396 KB
Volume
8
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Wiener Index of Graphs
On the Wiener Index of Graphs
✍ Xiaoying Wu; Huiqing Liu 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 368 KB
The hyper-Wiener index of graph operatio
The hyper-Wiener index of graph operations
✍ 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
-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

The Wiener index of the th power of a gr
The Wiener index of the th power of a graph
✍ Xinhui An; Baoyindureng Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 289 KB

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