Description

Exercise 6.1 (10pts)
Show that the following 3 drawings (of the Petersen graph) are isomorphic.
6 η ι
Exercise 6.2 (4pts)
(i) (2pts) Sketch all non-isomorphic simple graphs with 3 vertices.
(ii) (2pts) Sketch all 11 non-isomorphic simple graphs with 4 vertices and identify all pairs of complement graphs (including self-complementary ones, i.e., one that is isomorphic to its own complement).
Exercise 6.3 (2pts)
Show that two simple graphs are isomorphic iff their complement graphs are isomorphic.
Exercise 6.4 (2pts)
How many cycles of length n are there in the complete graph Kn, n ≥ 1?
Exercise 6.5 (2pts)
Consider the complete graph Kn, n > 0. Show that if Pi ni = n, ni ∈ N, then .
Exercise 6.6 (2pts)
Given a finite graph G with the degrees of every vertex at least 2, show that G contains a cycle (as a subgraph).
Exercise 6.7 (6pts)
A graph G is called k-regular if all vertices of G have the same degree k.
(i) (2pts) Show that a k-regular bipartite graph has no cut-edge for k ≥ 2.
(ii) (2pts) Show that a k-regular bipartite graph has a perfect matching for k ≥ 1.
(iii) (2pts) Show that every k-regular bipartite graph has a perfect matching for k ≥ 1.
Exercise 6.8 (2pts)
Given graph G, show that G is a tree iff G is connected and e is a cut-edge for all e ∈ E(G).
Exercise 6.9 (2pts)
Given a finite matroid M = (E,I), Show that if A,B are bases of M and a ∈ A−B, then there exists b ∈ B −A such that (A − a) ∪ b is also a basis.
Exercise 6.10 (6pts)
Given a set E with |E| = n, n ∈ N, Let I = {F ⊂ E | |F| ≤ k}, 0 ≤ k ≤ n. Show that (E,I) is a matroid.
Exercise 6.11 (2pts)
Sketch all 8 spanning trees of the following graph.

Exercise 6.12 (10pts)
Given the following simple connected graph, with weighted edges specified as follows,

(i) (5pts) Find a minimum-weight spanning tree via Kruskal’s algorithm. List the edges chosen in order and sketch the tree.
(ii) (5pts) Given the root vertex a, find a shortest-path spanning tree via Dijkstra’s algorithm. List the edges chosen in order, list the shortest path distance (from root vertex) to each vertex. Sketch the tree.
Page 2 of 2