✦ LIBER ✦

Relationship between the edge-Wiener index and the Gutman index of a graph

✍ Scribed by Knor, Martin; Potočnik, Primož; Škrekovski, Riste

Book ID: 121717324
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 360 KB
Volume: 167
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.12.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Wiener index of a graph

✍ Ante Graovac; Tomaž Pisanski 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 396 KB

The (revised) Szeged index and the Wiene

The (revised) Szeged index and the Wiener index of a nonbipartite graph

✍ Chen, Lily; Li, Xueliang; Liu, Mengmeng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On the Wiener Index of Graphs

✍ Xiaoying Wu; Huiqing Liu 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 368 KB

Improved bounds on the difference betwee

Improved bounds on the difference between the Szeged index and the Wiener index of graphs

✍ Klavžar, Sandi; Nadjafi-Arani, M.J. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 367 KB

The Szeged and the Wiener index of graph

The Szeged and the Wiener index of graphs

✍ S. Klavžar; A. Rajapakse; I. Gutman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 283 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