Edge, edge, and edge
Computer Science
Level
pending
Given a graph with 2002 nodes. Find the minimum number of edges so that that graph is connected!
2001
2002
4006002
2003001
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Note that, connected graph with minimum edge is called tree. A tree with N nodes has N-1 edges. So, a connected graph with 2002 nodes has at least 2001 edges.