Speaker
Mr
Riste Škrekovski
(FIŠ,FMF,FAMNIT,IMFM)
Description
Let $G$ be a graph. The Wiener index of $G$, $W(G)$, is defined as the sum of distances between all pair of vertices of $G$.
Denote by $L^i(G)$ its $i$-iterated line graph. In the talk, we consider the equation $W(L^i(T)) = W(T)$ where $T$ is tree and $i\ge 1$.
Primary author
Mr
Riste Škrekovski
(FIŠ,FMF,FAMNIT,IMFM)
