{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

spring08test2 - AMS 303 ‘ TEST 2A Spring 2008 Prof Tucker...

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

View Full Document Right Arrow Icon
Image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: AMS 303 , ‘ . TEST 2A Spring 2008 Prof. Tucker 1. Give the cycle structure representation for a 135 degree rotation of the corners of an 8-gon. -2. a) Construct the matching network and make a flow corresponding to the partial matching c— i, d— —g, e-j, f-h. ' b) Apply the Augmenting Flow Algorithm (show ALL labels) and from it obtain a 5—edge matching. 3. COnsider the game of Nim on the right. a) i 'I I I a) What is the Grundy number of the initial positon | I I I b) Make a move to get into a kernel position using pile 2. I I I I I c) Make a move to get into a position with Grundy number equal to 1 I I I I I I I d) Suppose that 1 or 4 or 5 sticks "can be removed at a_time, determine is the Gurndy number of the initial condition and then make a move into the kernel. 4. Give an expression for the'pattern inventory of 2-colorings of the edges of the unoriented figure ‘ on the right (rotations and flips allowed). 5. I. In the following table of remaining games, it is possible for the Bears to be co-champions (or outright champions) if they win all remaining games? Build the appropriate network model. Answer the questi0n with a feasible flow 1n the network you created or with an explanation of why one is not possible. If there are co- champions with the Bears, who are they? Wins Games with with with with Team to date to play Bears Lions Tigers Vampires Bears ,20 6 — _ 1 2 ' '3 Lions 25 6 1 — 3 2 Tigers 25 6 2 3 — l Vampires 23 6 3 . 2 1 — 11. Let G be a progressively finite graph with a kernel K and a Grundy function g( ). Form the graph G‘ by deleting the vertices in the kernel K. Let K1 be the kernel of G'. Show that K1 is precisely the set of vertice with g(x)— - 1 1n the original graph G (that IS, show that the vertices with g(x)- —- 1 in the original graph have properties of a kernel 1n G). ' _ ...
View Full 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