Use minimum spanning tree concept for this graph.

D 22 E
52
A
48
47 56
24

C 37 60 F
29
H
30
42 34

B
60 G
ANSWER: 235

D 22 E
52
A
48
47 56
24

C 37 60 F
29 H
30
42 34

B
60 G
Make a tree by spanning the graph below.

E D

A C
B

H
ANSWER: (one possible answer)

E D

A C
B

H
For the given graph, find the Hamilton circuit.

B C

A D
H

F E
One possible answer:
A–F–H–E–D–C–B–A

B C

A D
H

F E
For the weighted graph shown, find an approximate optimal circuit
starting at vertex A using the nearest neighbor method.

31

27 B 26
A E
29 30
22
25 31
23

C 23 D
The nearest neighbor method is the same as minimal spanning tree.
A – D – C – B – E – A optimal circuit (125)

31

27 B 26
A E
29 30
22
25 31
23

C 23 D
Find the chromatic number of the graph, and find a coloring that uses that
number of colors.

E F G

A D C
Find the chromatic number of the graph and find a coloring that uses that
number of colors. 4 COLORS

E F G

A D C
Decide if the graph has an Euler path or circuit. Explain.
C
D
C
B
B D
E
F

A E A
F
B G
G C

A
G D

E
F
Decide if the graph has an Euler path or circuit. Explain.
C
D
C
B
B D
E
F

A E A
F
Euler Circuit Neither G
- All nodes have even B C
G Euler Path
degree.
- Nodes E and G
A have odd degrees.
G D

E
F