Unformatted text preview: nected component. No cycles means that no additional edges are given, yielding exactly | V | − 1 edges. (b) Proof by contradiction. If the graph is not connected, then by de f nition there are at least two components. At least one of these components has i vertices with i or more edges (by the pigeonhole principle). Given i − 1 edges to connect the component, the i th edge must then directly connect two of the vertices already connected through the other edges. The result is a cycle. Thus, to avoid a cycle, the graph must be connected. 69...
View Full Document
This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.
- Fall '08