This preview shows page 1. Sign up to view the full content.
Unformatted text preview: = r A XX r C DF G vD (c) These graphs are not isomorphic. Consider the unique vertices B and r of degree 3 in each graph. Vertex B is adjacent to two vertices of degree 1, but vertex r is not. (d) These graphs are isomorphic. One possible isomorphism is given by as illustrated. cp(A) = p, cp(B) = q, cp(C) = u, cp(D) = t, cp(E) = w, cp(F) = r, cp(G) = v, cp(H) = s A D 1M1 B C BWi PA D q C t u w v r s F H 5. (a) [BB] No; it has a vertex of degree 5....
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details