{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

If yes show the simplest example you can think of

Info iconThis preview shows pages 3–7. Sign up to view the full content.

View Full Document Right Arrow Icon
there an Eulerian digraph whose underlying graph is not Eulerian?
Background image of page 3

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

View Full Document Right Arrow Icon
MAD3305/Final Exam Page 4 of 8 _________________________________________________________________ 7. (10 pts.) Apply Kruskal’s algorithm to find a minimum spanning tree in the weighted graph below. 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 and v is a vertex of G, κ ( G-v ) ≥κ (G) - 1. Provide the simple proof for this. (c) If G is a Hamiltonian graph, what can you say about κ
Background image of page 4
MAD3305/Final Exam Page 5 of 8 _________________________________________________________________ 9. (15 pts.) Find a minimum spanning tree for the weighted graph below by using only Prim’s algorithm and starting with the vertex a. 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? ________________________________________________________________ 10. (10 pts.) (a) What is the chromatic number of any nontrivial tree? Why? (b) Give an example of a nonplanar graph G with χ (
Background image of page 5

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

View Full Document Right Arrow Icon
MAD3305/Final Exam Page 6 of 8 _________________________________________________________________ 11. (10 pts.) (a) Suppose that G is a bipartite graph with partite sets U and W with U W . What does it mean to say that U is neighborly? (b)
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page3 / 8

If yes show the simplest example you can think of...

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

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online