Find a Hamilton circuit for each graph below. Graphs b K1 d K2 K3 • Hamilton circuit for K¡: • Hamilton circuit for K;: • Hamilton circuit for K;:

Find an Euler circuit for each graph below. b. Graphs K2 K1 K3 Euler circuit for K: • Euler circuit for K2: Euler circuit for K3:

Q1D. Consider the following graph: a с f d e How many vertices are there in the graph? How many edges are there in the graph? A

Q16. Consider the graph with the following vertices, edges, and weights (weights are stated as the third entry for each edge in E, with the first two entries representing the vertices joined by the edge): V = {a, b, c, d, e, f} E = {{a, b, 9}, {a, c, 6}, {a, d, 1}, {a, f, 4}, {b, c, 2}, {b, f, 8}, {c, d, 3}, {c, f, 5}, {d, e, 4}, {d, f, 8}} a Your Answer: 3 f What is the total weight of a minimum spanning tree of the graph? Answer d CD

Q1: How many vertices does this object show   Q2: How many vertices does this object have