hw12 - CS 330 Discrete Computational Structures Fall...

Info icon This preview shows page 1. Sign up to view the full content.

CS 330 : Discrete Computational Structures Fall Semester, 2014 Assignment #12 [Extra Credit] Due Date: Friday, Dec 12 Suggested Reading: Chapter 11.1 - 11.3 and 11.9 - 11.11 of Lehman et al. These are the problems that you need to turn in. Always explain your answers and show your reasoning. Spend time giving a complete solution. You will be graded based on how well you explain your answers. Just correct answers will not be enough! 1. [10 Pts] Give an example of a graph that has 6 vertices with degrees of 5, 3, 3, 3, 2, 2. How many edges does your graph have? Can you argue that any graph with these properties
Image of page 1
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