If yes show the simplest example you can think of

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

View Full Document Right Arrow Icon
[If "yes", show the simplest example you can think of.]
Image of page 3

Info icon This 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 κ (G)? Why??
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 χ (G) = 4.
Image of page 5

Info icon This 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) K 3,3 is given below with partite sets U = {a, b, c} and W = {A, B, C}. Give a connected bipartite subgraph of K 3,3 with the same partite sets but with U failing to be neighborly. Explain why your example satisfies the requirements. _________________________________________________________________ 12. (15 pts.) (a) State Kuratowski’s Theorem that characterizes planar graphs. (b) Without using Kuratowski’s Theorem, explain briefly how one can see that K 5 is not planar.
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 ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern