The cyclic wirelength of trees (Q1270789)

A tree \(T\) on \(n\) vertices can be embedded in an \(n\)-cycle \(C\) or in a path \(L\) of order \(n\). The ``cyclic'' or ``linear wirelength'' of \(T\) can be defined by using the number of paths joining endvertices of edges of \(T\) in these host graphs. By a theorem of Hall the authors show that these two wirelengths coincide.