Math Problem Statement
Let P : u0,u1,...,ut be a longest path in a tree T. Show, for every vertex u in T , that ecc(u) = max{dist(u, u0 ), dist(u, ut )}.
Solution
Math Problem Analysis
Mathematical Concepts
Graph Theory
Trees
Paths
Formulas

Theorems

Suitable Grade Level
Advanced Undergraduate