This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a and b . The &ve paths from a to b are a;b a;c;b a;d;b a;c;d;b a;d;c;b (f) Label the vertices of K 3 ; 3 . Pick two vertices and list all the paths from one of them to the other . Suppose we let X = f a;b;c g and Y = f d;e;f g . The nine paths from a to b are a;d;b a;e;b a;f;b a;d;c;e;b a;d;c;f;b a;e;c;d;b a;e;c;f;b a;f;c;d;b a;f;c;e;b The nine paths from a to d are a;d a;e;b;d a;e;c;d a;f;b;d a;f;c;d a;e;b;f;c;d a;e;c;f;b;d a;f;b;e;c;d a;f;c;e;b;d 2. Construct a graph with 5 vertices and 6 edges that is not connected . The graph K 4 has 4 vertices and 6 edges. If we add an isolated vertex, we get a graph with 5 vertices and 6 edges that is not connected. e e e e e & & & @ @ @ H H H...
View Full
Document
 Spring '08
 STAFF

Click to edit the document details