No label defined (Q4458211)

Let \(d(G,k)\) denote the number of pairs of vertices of a graph \(G\) at distance \(k\) of each other. Then \(W_\lambda(G):=\sum_{k\geq 1} d(G,k)k^\lambda\) redefines the Wiener-type index of order \(\lambda\) and extends it to unconnected graphs. This allows an easy proof of the new identity for a tree \(T=(V,E)\) on \(n\) vertices: \[ W_{\lambda+1}(T)=(n-1)W_\lambda(T)- \sum_{e\in E}W_\lambda(T-e)= (n-1)W_\lambda(T)- \sum_{v\in V}W_\lambda(T-v). \] As an application several Wiener-type and derived indices are obtained for stars and paths \(P_n\), e.g. \(W_1(P_n)=\binom{ n+1}{ 3}\) and \(W_2(P_n)=\frac{n}{2}\binom{ n+1}{ 3}\).