What does network diameter mean if it is called the longest shortest path?

Conditions

• The network is connected enough that shortest-path distances between the compared node pairs are defined.
• Distance is measured by shortest paths.

Reasoning, step by step

1. Identify shortest-path distances between node pairs in the network.
2. Select the largest among those shortest-path lengths.
3. Read off the value from the highlighted path in the displayed example.

Example

In the example network, the diameter is 4, which is the length of the longest shortest path shown.

Common misconceptions

• Confusing diameter with an arbitrary long route; diameter is not any long path, but the maximum among shortest-path distances between node pairs.

Watch the explanation

Explore next

• How does characteristic path length differ from network diameter?
• Why does the lecturer say scale-free networks are robust?