A graph can have 0 edges. T F A connected graph with n nodes can have n 2 edges. T F The number of edges in a graph is O(n). T F Some graphs are not bipartite. T F Some graphs are both bipartite and connected. T F Every graph with n vertices and n - 1 edges is a tree. T F A graph with at least 3 cycles cannot be bipartite. T F Prim and Kruskal are 2 different names for the same algorithm. T F There is a polynomial time algorithm for SINGLESOURCESHORTESTPATH (ie an algorithm that runs in time big-O of some polynomial). T F Arbor Day was designed to celebrate the lives of Prim, Kruskal, and Dijkstra because of their important work on trees. T F