You are on page 1of 4

CS 205 Quiz #7A Nov 15, 2012

NAME: ____________________________SOLUTIONS_____________________________________

RUID:___________________________________________________________________________

Electronic Devices are not permitted during the quiz. These include but are not restricted to calculators, computers and cell phones. No communication between students or anyone outside of class is permitted during the quiz. Textbooks, notes and any other written materials are not permitted during the quiz.

DO NOT OPEN UNTIL INSTRUCTED TO DO SO

1. Consider the following graph.

______5_____ a) How many vertices are present?

______6_____ b) How many edges are present?

______0_____ c) How many edges are loops?

____YES_____ d) Are vertices B and C adjacent?

__{B,C,E}___ e) What is the neighborhood of vertex D?

______3_____ f) What is the degree of vertex C?

_____NO_____ g) Is the graph a complete graph?

______3_____ h) How many subgraphs can be produced that are cycles? Vertex sets: {A,B,C}, {B,C,D}, {A,B,C,D} ______3_____ i) How many edges are in the subgraph induced by { A, C, D, E }? A-C, C-D, D-E ______A_____ j) If the graph is a simple undirected graph and E represents the edges, which of the following is most appropriate to describe E? A) Set containing Sets of size 2 B) Set of Ordered Pairs C) Set containing Sets of any size D) Set of Tuples E) None of the above options can be used

2. For each pair of graphs below, determine whether they are isomorphic. If the graphs are isomorphic, then fill in blanks to indicate which vertex in the first graph maps to which other vertex in the second graph. If the graphs are not isomorphic, then provide a clear reason. a)

Yes Isomorphic. A ____7____ B ____4____ C ____3____ D ____6____ E ____5____ F ____2____ G ____1____

b)

Yes Isomorphic. A ____2____ B ____4____ C ____1____ D ____3____

3. Determine if the following graphs are bipartite. If so, provide the partitions. If not, provide a clear reason. a)

Yes Bipartite. { 1, 3, 5, 7 } and { 2, 4, 6, 8 }

b)

Not bipartite contains a cycle with an odd number of edges {a,b,c}. Consider placing a in partition 1, then b and c must be in partition 2. However, if b and c are both in partition 2, then it is not bipartite. Thus, it is impossible to be bipartite.