How do you prove that a graph is connected iff it has exactly one component?

Printable View

- Feb 17th 2011, 03:46 PMalexandrabel90component
How do you prove that a graph is connected iff it has exactly one component?

- Feb 17th 2011, 04:17 PMPlato
- Feb 17th 2011, 04:19 PMalexandrabel90
- Feb 17th 2011, 11:24 PMemakarov
By definition, a component is not connected to vertices outside of it. In a connected graph, any proper subgraph (not equal to the original graph) is connected to some outside vertex; therefore, such subgraph is not a component.