This preview shows page 1. Sign up to view the full content.
304
Solutions to Exercises
(c) The possible outdegree sequences listed for the vertices of the bipartition sets of sizes 2 and 3
respectively are
3,3,0,0,0
3,2,0,0,1 3,1,0,1,1 3,0,1,1,1 2,2,2,0,0
2,2,1,1,0
2,1,2,1,0 2,1,1,1,1
2,0,1,1,2 1,1,2,2,0
1,1,2,1,1
1,0,2,2,1 0,0,2,2,2
The corresponding graphs are shown.
MMMM
19. [BB] No.
K3
is connected, but
6
is not strongly connected.
20. [BB] True. Let
v
be a vertex. Since
9
has at least two vertices and
9
This is the end of the preview. Sign up
to
access the rest of the 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.
 Summer '10
 any
 Graph Theory, Sets

Click to edit the document details