Unformatted text preview: the graph. 3. Show that a bipartite graph with an odd number of vertices does not have a Hamiltonian cycle. 4. Show that a vertex c in the connected simple graph G is a cute vertex if and only if there are vertices u and v , both diﬀerent from c , such that every path between u and v passes through c . Note: A cut vertex is a vertex v in G such that the removal of v from G results in disconnecting the graph....
View Full Document
This note was uploaded on 01/15/2012 for the course ECON 101 taught by Professor N/a during the Fall '11 term at Middlesex CC.
- Fall '11