1 For the given undirected graph find a The total number of

1) For the given undirected graph, find: (a) The total number of edges: (b) The degree of each vertex (i.e. degrees for a, b, c, d, e, f): 2) If G is a simple graph with 15 edges and G , the complementary graph of G, has 13 edges, determine how many vertices G has. Show/explain how you arrived at your answer. {2 0 2 3) Draw the graph represented by the adjacency matrix: 4) Determine whether the given pair is isomorphic. Exhibit an isomorphism or provide an argument that none exists. 5) Are the simple graphs with the following adjacency matrices isomorphic? Why or why not? (a)

Solution

a) total edges = 13 b) deg(a)=6 deg(b)=6 deg(c)=6 deg(d)=5 deg(e)=3 deg(f)=0