Discrete Mathematics with Graph Theory (3rd Edition) 326

Discrete Mathematics with Graph Theory (3rd Edition) 326 -...

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

View Full Document Right Arrow Icon
324 Exercises 12.1 Rnd 1 Rnd 2 Rnd 3 1. [BB] Series A ~:==J?L·-I Series E ~? ----, Series C 3 6 Series B 2 7 4 Series D 5 2. William Harry ? ? Series G Series F ~ __ . . .J ~~? G-- ? Victoria Champion 3. There are thirteen increasing subsequences, as shown. Seven have level one, eleven have level two and three
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: have level three. 4. There are six possible outcomes corresponding to the five paths from start to vertices denoted J together with the path Start-D-D-D-D-D. In five of these, John wins a game. Start Solutions to Exercises Start 9 9 5 J...
View Full Document

This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online