MTH 210

Midterm Test Solutions

1. (a) Find the order, size, total degree and degree sequence.
Degree Sequence: 3, 3, 4, 4, 4, 4. Order: 6, Total Degree: 22, Size 11
(b) How many connected components does G have? 1
(c) Find a walk from a to c which is not a path. Either a walk which contains a cycle
like abedbc or one which repeats an edge like abcbc
(d) Find an Eulerian circuit in G. D.N.E. There is a vertex of odd degree, f or c.
(e) Find an Hamiltonian circuit in G. abcdef , or any other circuit which covers all
of the vertices..
(f) Draw a spanning tree of G.
a t

t
@
@
@
@
@t c

f t
@
@
@
@
@t

G
2. For each of the following either explain why the specified graph cannot exist (quote
any theorems you use), or draw a graph with the given property.
(a) A simple graph with degree sequence 1, 1, 2, 3, 5.
D.N.E. There is a vertex of degree 5, in a simple graqph this would imply 5 other
vertices, giving a total of 6 vertices. But there are only 5.
(b) A simple graph with degree sequence 1, 2, 2, 3.
t
@

t
@
@

@
@t

(c) The cycle of length 5, C5 , and its complement C5 .

t

t
@

@
@t
t

C5

tP
t
@PPP
PP
@
PP
t
@



@

t 
@t

C5
1

(d) A tree with 4 leaves on 4 vertices D.N.E. 4 leaves implies at least 4 edges, but a
graph with 4 vertices must have 3 edges.
(e) A full binary tree with 5 vertices and 3 leaves.
t
@

t
@
t

@
@t
@
@
@t
@t OR

t
@
@
@t

t
@
t

@
@t

(f) A binary tree with height 2 and 5 leaves D.N.E. We would require 5 22 .
3. Give, up to isomorphism, all binary trees with height two.
t

t
t

t
t

t
@
@ t
@
@
@t t

t
@

t
@
@@t
t
t
@
@ t
t
@
@
@
@
@t
@t t

t
@
@
@t
t

@
t
@t
@
@@t

t
@
@ t
t
@
@
@
@
t @t
@t

4. Consider the sequence

a0 = 0;
an = an1 + 2n + 3,

n 1.

(a) Find a1 , a2 , a3 and a4 . Keep your intermediate answers as you will need them
for the next part of the question.
n
0
1
2
3
4

an
0
(2 1 + 3)
(2 1 + 3) + (2 2 + 3)
(2 1 + 3) + (2 2 + 3) + (2 3 + 3)
(2 1 + 3) + (2 2 + 3) + (2 3 + 3) + (2 4 + 3)

(b) Use iteration to find an analytic formula for the sequence an . Simplify your answer
as much as possible, showing your work. In particular, your final answer should
not contain summation signs. Quote any formulas or rules that you use.
Pn
Pn
an =
i=1 3 +
i=1 2i
n(n + 1)
3n + 2
2
3n + n2 + n
n2 + 4n
n(n + +4)

=
=
=
=
2

5. Show by weak induction that

n
X

2i = 2 (2n 1)

i=1

for every n > 0.

P1

2i = 2, 2(21 1) = 2 1 = 2.
P
Inductive Step Let n = k > 1. Assume true for k, i.e. ki=1 2i = 2(2k 1).
Base Case Let n = 1,

Consider

Pk+1
i=1

i=1

2i =
=
=
=
=

P
2k+1 + ki=1 2i
2k+1 + 2(2k 1)
2k+1 + 2k+1 2
2 2k+1 2
2(2k 1)

P
(Definition of
)
(IH)
(Algebra (Distributive Law))
(Algebra))
(Algebra (Distributive Law)))

So True for n = k + 1.

6. Let bn be the sequence defined by b0 = 0, b1 = 1 and

bn = 5bn1 6bn2 , for n > 1.
Use strong induction to show that
bn = 3n 2n .
Base Case Let n = 0, b0 = 0, 30 20 = 1 1 = 0.
Let n = 1, b1 = 1, 31 21 = 3 2 = 1.
Inductive Step Let n = k > 1. Assume that for i with 0 i < k, Bi = 3i 2i .
Consider bk =
=
=
=
=
=

5bn1 6bn2
5(3k1 2k1 ) 6(3k2 2k2 )
5 3k1 5 2k1 6 3k2 + 6 2k2 )
5 3k1 5 2k1 2 3k1 + 2 2k1 )
(5 2) 3k1 (5 3) 2k1
3k 2k

So True for n = k.

(Definition of bk , k > 1)
(IH)
(Algebra)
(Algebra)
(Algebra)
(Algebra)