1. T F All Bipartite graphs are trees
2. T F Some trees are not Bipartite graphs
3. T F All graphs that can be colored in 2-colors are trees
4. T F All trees can be colored in 2-colors.
5. T F If a graph contains a cycle that includes all of the edges of the graph, then the cycle
is an Euler Cycle.
6. T F Every graph has an even number of nodes of odd degree.
7. T F If a graph is connected, then its complement must be connected.
8. T F If a graph has no cycles, then the graph is a tree.
9. T F If a graph has two faces, then the graph must have a cycle.
10. T F If a graph has more than one spanning tree, then the graph must have a cycle.
11. T F Kruskal's algorithm applied to a connected graph always produces a minimal
spanning tree.
12. T F Prim's algorithm applied to a connected graph sometimes does not produce a
minimal spanning tree.
13. T F The nearest neighbor algorithm applied to the traveling salesperson problem
always produces the optimal solution.
Short Answer
