most recent 30 from http://mathoverflow.net 2013-05-23T08:36:49Z http://mathoverflow.net/feeds/user/18992 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/6833/difference-between-connected-vs-strongly-connected-vs-complete-graphs/79905#79905 Ricky 2011-11-03T08:21:24Z 2011-11-03T08:21:24Z

<p>Alex, can you explain a bit more on the difference between a Connected Graph and a Complete Graph?</p> <p>It seems the only difference is that one uses path and the other uses edge. Aren't they the same? When you said for a Complete Graph, it's when: </p> <p>"are undirected graphs where there is an edge between every pair of nodes". </p> <p>Well, since it's an undirected graph then you can traverse both ways, hence why it's an "edge". But doesn't that mean the same as 'path'? I.e, there's a path between every two nodes that you can traverse between? So isn't that just the same as the definition of a Connected Graph then?</p>