Just to clarify, the diameter is the maximum of the minimum distances between any two nodes. Based on what happens, it is possible that a longer path occurs, based on how the path routing is implemented and based on network business.
This comment was marked helpful 0 times.
adsmith
How is a ring interconnect a regular graph? The degree of nodes on the edges/corners doesn't match the degree of nodes in the interior.
This comment was marked helpful 0 times.
wcrichto
@adsmith a ring does not have edges or corners--it's a ring! Every node has degree 2. It's A → B → C → A ...
Just to clarify, the diameter is the maximum of the minimum distances between any two nodes. Based on what happens, it is possible that a longer path occurs, based on how the path routing is implemented and based on network business.
This comment was marked helpful 0 times.
How is a ring interconnect a regular graph? The degree of nodes on the edges/corners doesn't match the degree of nodes in the interior.
This comment was marked helpful 0 times.
@adsmith a ring does not have edges or corners--it's a ring! Every node has degree 2. It's A → B → C → A ...
This comment was marked helpful 0 times.