A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Let G be a graph. Denote by L i (G) its i-iterated line graph and denote by W (G) its Wiener index. Dobrynin, Entringer and Gutman stated the following problem: Does there exist a non-trivial tree T and i ≥ 3 such that W (L i (T )) = W (T )? In a series of five papers we solve this problem. In a previous paper we proved that W (L i (T )) > W (T ) for every tree T that is not homeomorphic to a path, claw K 1,3 and to the graph of "letter H", where i ≥ 3. Here we prove that W (L i (T )) > W (T )doi:10.26493/1855-3974.250.d49 fatcat:ytl7w3hh7jbavc26buzdkzuxfa