Talk:Distance (graph theory)

From Wikipedia, the free encyclopedia

You have new messages (last change).

what happens to diameter if the graph is not connected?

[edit] pseudo-peripheral vertices in directed graphs ?

Does the given "Algorithm for finding pseudo-peripheral vertices" work also in directed graphs? If yes, do I need to use indegree or outdegree? If not, it should be mentioned that the algorithm is only for undirected graphs. 80.248.242.52 18:14, 26 December 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../d/i/s/Talk%7EDistance_%28graph_theory%29_26c1.html"