Ungerichteter Graph/Zusammenhängend/Radius/Definition

Radius (Graph)

Unter dem Radius eines zusammenhängenden Graphen ${}G=(V,E)$ versteht man den Ausdruck

\operatorname {min} \left(\operatorname {max} \left(d(u,v){|}u\in V\right){|}v\in V\right).

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.