Zaferanieh, Mehdi; Fathali, Jafar - In: Computational Statistics 76 (2012) 2, pp. 147-160
Let T = (V, E) be a tree. A core of T is a path P, for which the sum of the weighted distances from all vertices to … weights. We prove that, when the sum of the weights of vertices is negative, the core must be a single vertex and that, when … the sum of the vertices’ weights is zero there exists a core that is a vertex. Morgan and Slater (J Algorithms 1 …