First Name:  Last Name:

1.  What is the smallest number of edges a graph with 6 vertices can have?

a.  0

b.  1

c.  5

d.  10

e.  15

2.  What is the greatest number of edges a graph with 6 vertices can have?

a.  0

b.  1

c.  5

d.  10

e.  15

3.  What is the smallest number of edges a connected graph with 6 vertices can have?

a.  0

b.  1

c.  5

d.  10

e.  15

4.  What is the greatest number of edges a disconnected graph with 6 vertices can have?

a.  4

b.  6

c.  8

d.  10

e.  15

5.  What is the smallest number of leaves a tree with 10 vertices can have?

a.  0

b.  1

c.  2

d.  9

e.  10

6.  What is the greatest number of leaves a tree with 10 vertices can have?

a.  0

b.  1

c.  2

d.  9

e.  10

7.  What is the fewest number of directed Hamiltonian paths a tournament with 3 vertices can have? (A directed Hamiltonian path does not end where it begins)

a.  0

b.  1

c.  2

d.  3

e.  4

8.  What is the greatest number of directed Hamiltonian paths a tournament with 3 vertices can have? (A directed Hamiltonian path does not end where it begins)

a.  0

b.  1

c.  2

d.  3

e.  4