Wiener index of iterated line graphs of trees homeomorphic to the claw K1,3

Martin Knor, Primož Potočnik, Riste Škrekovski


Let G be a graph. Denote by Li(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(Li(T)) = W(T)? In a series of five papers we solve this problem. In a previous paper we proved that W(Li(T)) > W(T) for every tree T that is not homeomorphic to a path, claw K1,3 and to the graph of "letter H", where i ≥ 3. Here we prove that W(Li(T)) > W(T) for every tree T homeomorphic to the claw, TK1,3 and i ≥ 4.


Wiener index, iterated line graph, tree, claw

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications