Guided

Noteboo
k in
GED10
Task List
2
T h e g o a l o f t h i
Theory. The discussions will center on the

(Mathe applications and the theoretical treatment of the

subject is deliberately evaded. Those who may be
interested to know more about the topics may read
the reference materials given in the textbook.

matics The topics are grouped into three lessons: Graph

Modelling, Eulerian and Hamiltonian Graphs and
their applications to Weighted Graphs, and Graph
Coloring.

in the Keep track of your progress in this lesson by

checking the number corresponding to each task.

Modern
World)
2ND QUARTER, SY2020-2021 GED 102 WEEK 10

_____ 1. Watch the Youtube videoclip about Konigsberg Problem.

_____ 2. Watch the introductory video (Module 3 Topic 3 Introduction)

_____ 3. Read/Watch Module 3 Topic 3 Lesson 1 Modelling with Graphs

_____ 4. Read/Watch Module 3 Topic 3 Lesson 2 Eulerian and Hamiltonian Graphs

and Weighted Graphs.

_____ 5. Read/Watch Module 3 Topic 3 Lesson 3 Graph Coloring and Applications

_____ 6. Accomplish HW10 in BB.

_____ 10. Submit WGN 10.

Lesson 1. Modelling with Graphs

Highlights

A. Give a brief definition of the following:

1. Graph

2. Degree of a vertex
2ND QUARTER, SY2020-2021 GED 102 WEEK 10

3. Isomorphic graphs

B. Give 4 types of graphs and give a brief description (you may describe in
words or just draw a sample graph).

Lesson 2. Eulerian and Hamiltonian Graphs, Weighted Graphs

Highlights

A. Define the following:

1. Walk

2. Path, Trail

3. Cycle, Circuit
2ND QUARTER, SY2020-2021 GED 102 WEEK 10

B. What is Eulerian Graph?

C. What is Hamiltonian Graph?

D. Describe how to solve the Konigsberg Problem.

Lesson 3. Graph Coloring

Highlights

A. Give a summary of the Greedy Algorithm.

2ND QUARTER, SY2020-2021 GED 102 WEEK 10

B. Give a summary of the Edge-Picking Algorithm.

C. What is a graph coloring, and how is it applied?