Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (dls):

Diameter of a graph

OpenStudy (dls):

Can anyone explain the meaning of "longest shortest path" in terms of graph diameter preferrably with the help of an example?

OpenStudy (qwertty123):

Hello there! The diameter of a graph is the maximum eccentricity of any vertex in the graph. That is, it is the greatest distance between any pair of vertices. To find the diameter of a graph, first find the shortest path between each pair of vertices. The greatest length of any of these paths is the diameter of the graph.

OpenStudy (dls):

can you show an example ?

OpenStudy (qwertty123):

OH sorry I didn't see that! Um an example... not good at giving one

OpenStudy (unklerhaukus):

|dw:1455107449875:dw|

OpenStudy (unklerhaukus):

|dw:1455107794640:dw|

OpenStudy (qwertty123):

@DLS

OpenStudy (dls):

thanks :) it makes sense now

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!