Use the havel hakimi theorem to show that the

Info icon This preview shows pages 2–4. Sign up to view the full content.

Use the Havel-Hakimi Theorem to show that the sequence s: 5,5,4,4,3,3 is the degree sequence of some graph. Then show there is a plane graph with this sequence as its degree sequence. [You may need to do a second drawing.] _________________________________________________________________ 4. (10 pts.) (a) Explain why is Hamiltonian for n 5. C n (b) Give an example of a simple connected graph G of order n with (G) < n/2 that is Hamiltonian. What does this tell us about Ore’s Theorem?
Image of page 2

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

MAD3305/Final Exam Page 3 of 8 _________________________________________________________________ 5. (15 pts.) Each of the following propositions may be proved by induction. Prove exactly one of them after clearly indicating which you are proving. (a) Every nontrivial connected graph G has a spanning tree. [Hint: If the order of the graph G is at least 3, Theorem 1.10 implies that G has a vertex v with G - v connected.] (b) If G is a connected plane graph of order n, size m, and having r regions, then n - m + r = 2. [Hint: Do induction on the size of G.] _________________________________________________________________ 6. (10 pts.) (a) What can you say about the order of any nontrivial digraph in which no two vertices have the same outdegree, but every two vertices have the same indegree? Why?? (b) What degree condition characterizes Eulerian digraphs? Is there an Eulerian digraph whose underlying graph is not Eulerian?
Image of page 3
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.
  • Summer '12
  • Rittered
  • Graph Theory, Planar graph, 5 pts, outdegree, D. König

{[ 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