Title of article
Some results on the Wiener index of iterated line graphs
Author/Authors
Dobrynin، نويسنده , , Andrey A. and Melʹnikov، نويسنده , , Leonid S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
469
To page
475
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 ( L 2 ( T ) ) .
Keywords
Wiener index , Distance in a graph , Line graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454211
Link To Document