Minimal among all the vertices


A vertex v in the tree T is a center for T if the eccentricity of v is minimal among all the vertices in T. Prove that if a tree T has two centers, then they must be adjacent.

Request for Solution File

Ask an Expert for Answer!!
Mathematics: Minimal among all the vertices
Reference No:- TGS0874990

Expected delivery within 24 Hours