This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Rob Bayer Math 55 Worksheet August 7, 2009
Isomorphisms 1. Give an explicit isomorphism between each of the following pairs of graphs: (a) L. I (b) 2%} d-I—a«1
“NM 5»an .1/ T T4
-~ 0 p 3 ('5? 2. Show that the following pairs of graphs are not isomorphic. You should be sure to explain why no
isomorphism can possibly exist. v. a s Q 3. How many non—isomorphic graphs are there with three nodes? With four? 4. For any graph G, the complement of G, denoted “G“, is the graph with the same vertex set as G and an edge
between u and 1) iff G does not have an edge between it and v (a) What is the complement of C4? .
(b) A graph is called “self-complementary” if G E ”C3. Show that is self—complementary. (c) Show that if G is a self-complementary graph with n vertices, then 11 E 0 or 1 (mod 4).
Hint: how many edges are in a self—complimentary graph with n vertices? (d) (Tricky—ﬁnish the rest and come back to this) Prove the following partial converse of part (c): If
n E 0 or 1 (mod 4), then there is a self—complimentary graph with n vertices. Hint: induction. 5. Find examples of nonwisomorphic graphs G1,G2 such that both G3 and G2 have the same number of nodes
with each given degree. Note that this shows that checking the degrees is not enough to determine whether two
graphs are isomorphic 6. True/False? If G; E G2 and H1 E H2, then G1 U H1 5 G2 U H2. . Connectivity 1. Find the (strongly) connected componenets in each of the following graphs. 8)
“Q D ”M
K/ a '9 r 2. Use a path/ connectivity argument to show that the following graphs are not isomorphic 3. Show that the relation “there is a path from a to b and from b to a” is an equivalence relation on the set of
nodes of a directed graph. What are the equivalence classes? 4. Why do we not talk about “weakly connected componenets”? 5. An Euler path is a simple path that uses every edge. Prove that a connected simple graph in which all vertices
have even degree has an Euler path. 6. (Tricky) Prove that a simple graph is bipartite iff it has no cycles of odd length. ...
View Full Document
- Summer '08