How do I prove that diameter of undirected Ring Topology is n/2?
closed as unclear what you're asking by Evil, David Richerby, Rick Decker, Tom van der Zanden, Juho Sep 30 '16 at 10:03
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
To prove that the diameter of the undirected ring topology is $n/2$:
Find two vertices $x,y$ at distance $n/2$.
Show that any two vertices $x,y$ are at distance at most $n/2$.
By the way, the diameter is more accurately $\lfloor n/2 \rfloor$.
I tried this:
If n is even then n/2th node is the farthest node, else (n-1)/2th or (n+1)/2th node would be the farthest node.
In case of 'n' nodes the number of edges is 'n'
Assuming : If we have a ring of n/2 nodes(in case of even number of nodes) or (n-1)/2 (in case if n is odd) then the number of edges would be n/2 or (n-1)/2 for the rings to be connected which we can consider as the diameter.
Hence, n/2 with a lower bound would be the answer.