Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419332 | Discrete Applied Mathematics | 2014 | 14 Pages |
Abstract
Let GG be a graph. Denote by Li(G)Li(G) its ii-iterated line graph and denote by W(G)W(G) its Wiener index. In Knor et al. (in press) we show that there is an infinite class TT of trees TT satisfying W(L3(T))=W(T)W(L3(T))=W(T), which disproves a conjecture of Dobrynin and Entringer. In this paper we prove that except the trees of TT, there is no non-trivial tree TT satisfying W(L3(T))=W(T)W(L3(T))=W(T). Consequently, for a tree TT and i≥3i≥3, the equation W(Li(T))=W(T)W(Li(T))=W(T) holds if and only if T∈TT∈T and i=3i=3.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
M. Knor, M. Mačaj, P. Potočnik, R. Škrekovski,