Nama : Wildan Rilo Pambudi

Kelas : TIF’N
Nim : 145150209111001
Prodi : Matkom

6.

SOLUTION :

To tell if there is a Euler circuit, we check whet

her every vertex has an even
degree. In this graph, b and c have degrees of 3 so
we immediately know that there is no
Euler circuit. However, since there are exactly two
vertices with an odd degree there is an
Euler path. One possible path is: b – c – i – b – a
– i – g – d – f – e – d – a – h – i – d – c.
It is worth noting that the path must start at one
of the odd vertices and end at the other.

10. Can someone cross all the bridges shown in this map exactly once and return to the starting
point?

SOLUTION :

I’ll skip the picture and simply put in the graph y

ou get when you turn the land masses
into vertices and the bridges into edges.
The degrees of each node are: 2, 4, 4, and 2. Since
every vertex has an even degree you
know that there is a Euler circuit (which is what t
he question is really asking). One
possible Euler circuit: A – B – C – B – D – C – A.

26. For which values of n do these graphs have an Euler circuit?

a) Kn b) Cn c) Wn d) Qn

SOLUTION :
a.) Every vertex in Kn has degree n-1. Kn has an Euler circuit if n is odd
b.) Every vertex in Cn degree two. Cn has an Euler circuit for every n
c.) Every vertex except the center of Wn has degree three. Wn has an Euler circuit for
no n
d.) Every vertex in Qn has degree n. Qn has an Euler circuit if n is even
32.

SOLUTION :

A Hamilton circuit does not exist since

f has degree 1

56. A knight’s tour is a sequence of legalmoves by a knight starting

at some square and visiting each square exactly once. A
knight’s tour is called reentrant if there is a legal move that
takes the knight from the last square of the tour back to where
the tour began. We can model knight’s tours using the graph
that has a vertex for each square on the board, with an edge
connecting two vertices if a knight can legally move between
the squares represented by these vertices.

Drawthe graph that represents the legalmoves of a knight

on a 3 × 3 chessboard?

SOLUTION