| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514601 | Electronic Notes in Discrete Mathematics | 2005 | 7 Pages |
Abstract
The Wiener index W(G) of a graph G is the sum of distances between all unordered pairs of vertices. This notion was motivated by various mathematical properties and chemical applications. For a tree T, it is known that W(T) and W(L(T)) are always distinct. It is shown that there is an infinite family of trees with W(T)=W(L2(T)).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andrey A. Dobrynin, Leonid S. Mel'nikov,