On the minimum diameter spanning tree

Правка en1, от Tommy_Shelby, 2021-06-07 21:04:08

Hello Everyone, I'm trying to find the minimum diameter spanning tree of a graph , I find some solutions that said that the minimum diameter is the diameter of the shortest path tree rooted at the center of the tree , but i dont know how to prove it . Any Help

Теги spanning tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Tommy_Shelby 2021-06-07 21:04:08 298 Initial revision (published)