gr-t2

# Sketch two graphs g and h that have the degree

This preview shows pages 3–4. Sign up to view the full content.

Sketch two graphs G and H that have the degree sequence s: 2, 2, 2, 2, 2, 2 and have the same order and size, but are not isomorphic. Explain briefly how one can readily see that the graphs are not isomorphic. (c) Explicitly realize C 5 and its complement below. [You may provide carefully labelled sketches.] Next, explicitly define an isomorphism from C 5 to its complement that reveals that C 5 is self-complementary.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
TEST2/MAD3305 Page 4 of 4 _________________________________________________________________ 7. (10 pts.) Find a minimum spanning tree for the weighted graph below by using only Prim’s algorithm and starting with the vertex g. When you do this, list the edges in the order that you select them from left to right. What is the weight w(T) of your minimum spanning tree T? _________________________________________________________________ 8. (15 pts.) (a) If G is a nontrivial graph, how is κ (G), the vertex connectivity of G, defined? (b) If G is a nontrivial graph, it is not true generally that if v is an arbitrary vertex of G, then either κ ( G-v )= κ ( G )-1o r κ ( G-v )= κ (G). Give a simple example of a connected graph G illustrating this. [A carefully labelled drawing with a brief explanation will provide an appropriate answer.] (c) Despite the example above, if G is a nontrivial graph and v
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page3 / 4

Sketch two graphs G and H that have the degree sequence s 2...

This preview shows document pages 3 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online