Talk:Distance (graph theory)

From Wikipedia, the free encyclopedia
WikiProject Mathematics (Rated Start-class, Mid-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Mid Importance
 Field:  Discrete mathematics

what happens to diameter if the graph is not connected?

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. 18:14, 26 December 2006 (UTC)


How do we know that peripheral vertices are hard to find? What is the asymptotic running time for the best algorithm to find a peripheral vertex? What is the asymptotic running time for the pseudo-peripheral vertex finding algorithm described in the text? (talk) 20:52, 26 February 2008 (UTC)


Why does the article use the term "geodetic distance"? The usual name is simply "distance". Zaslav (talk) 02:24, 27 October 2015 (UTC)

Graph theorists say "distance" but people from other parts of mathematics or physics, etc., sometime use "geodesic distance" or geodetic distance". It seems reasonable to mention it. McKay (talk) 03:02, 29 October 2015 (UTC)
Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Talk:Distance (graph theory)"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA