Open AccessTrees T satisfying W(L3(T))= W(T)
Author(s) -
Martin Knor,
Martin Máčaj,
Primož Potočnik,
Riste Škrekovski
Publication year - 2014
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1403551k
Subject(s) - mathematics , conjecture , combinatorics , iterated function , graph , wiener index , discrete mathematics , mathematical analysis
Let G be a graph. Denote by Li(G) its i-iterated line graph and denote by W(G) its Wiener index. We find an infinite class of trees T satisfying W(L3(T)) = W(T), which disproves a conjecture of Dobrynin and Entringer [Electronic Notes in Discrete Math. 22 (2005) 469-475].