Guided

Noteboo
k in
GED10 Task List

The goal of

2 Theory. The discussions will center on the

applications and the theoretical treatment of the
subject is deliberately evaded. Those who may be
interested to know more about the topics may read

(Mathe
the reference materials given in the textbook.

The topics are grouped into three lessons: Graph

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

matics Coloring.

Keep track of your progress in this lesson by

in the
checking the number corresponding to each task.

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

___/__ 1. Watch the introductory video (Module 3 Topic 3 Introduction)

___/__ 2. Watch the Youtube videoclip about Konigsberg Problem.

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

___/__ 4. Work out HW 10 Items #1.

___/__ 5. Read/Watch Module 3 Topic 3 Lesson 2 Eulerian and Hamiltonian Graphs

and Weighted Graphs.

___/__ 6. Work out HW 10 Items #2 and #3.

___/__ 7. Read/Watch Module 3 Topic 3 Lesson 3 Graph Coloring and Applications

___/__ 8. Work out HW 10 Items #4 and #5.

___/__ 9. Submit HW 10.

___/__ 10. Submit WGN 10.

Lesson 1. Modelling with Graphs

Highlights

A. Give a brief definition of the following:

1. Graph

A graph is a set of objects called vertices (or nodes) connected by links called
edges that can be either directed (one-way) or undirected (two-way) in the
context of mathematics, notably graph theory.

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

In a graph, the degree of a vertex is the number of edges that are incident to
(or meet at) the vertex. In a directed graph, you can have different "in-
degree" and "out-degree" counts based on the edge direction.

3. Isomorphic graphs

Two graphs are isomorphic if their vertices and edges have a one-to-one
correspondence that preserves the graphs' connectedness. That is, they
share the same overall form or structure, even if their exact layouts or labels
differ.

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

Undirected Graph: In an undirected graph, edges have no direction. That is, if

there's an edge between vertices A and B, it doesn't matter whether you go
from A to B or B to A.

Example: A simple triangle where each corner is a vertex and each side is an
edge.

Directed Graph (Digraph): In a directed graph, each edge has a direction. An

edge from A to B is not the same as an edge from B to A.

Example: A one-way road system can be represented as a directed graph with

intersections as vertices and roads as edges.

Weighted Graph: A weighted graph has a number (the weight) associated with
each edge. The weight often represents costs, lengths or capacities, depending
on the problem at hand.

Example: A road map where towns are vertices, roads are edges, and the
distances between towns are the weights.

Bipartite Graph: A bipartite graph's vertices can be divided into two sets, such
that all edges connect a vertex in one set with a vertex in the other set, and no
edges exist that connect vertices within the same set.

Example: A graph representing a job assignment problem, with people as

vertices in one set, jobs in the other set, and edges representing who can do
which job.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

Lesson 2. Eulerian and Hamiltonian Graphs, Weighted Graphs

Highlights

A. Define the following:

1. Walk

In a graph, a walk is a finite or infinite sequence of edges that connects a set of

vertices. A walk can return to the same vertex or travel the same edge multiple
times.

2. Path, Trail

A path is a walk with well defined vertices and edges. In other terms, it is an
edge sequence that connects two vertices without returning to any vertices or
edges. A trail is a stroll across a graph in which no edges are duplicated but
vertices can be visited again and again.

3. Cycle, Circuit

A cycle is a path that has at least one edge that starts and finishes at the same
vertex. In other words, it's a path with the same first and last vertices. A circuit
is similar to a cycle in that it is a path that begins and finishes at the same
vertex. Some people consider "cycle" and "circuit" to be synonyms, however
several literature separate them in the manner described above.

B. What is Eulerian Graph?

An Eulerian graph is one in which all of the vertices have the same degree. This
characteristic assures that every edge in the graph may be traversed precisely
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

once and returned to the beginning vertex, resulting in what is known as an

Eulerian cycle or circuit.

C. What is Hamiltonian Graph?

A Hamiltonian graph is one with a Hamiltonian cycle. This means that it is

possible to visit each vertex once without returning to the starting vertex.

D. Describe how to solve the Konigsberg Problem.

Leonhard Euler solved this problem in 1736, and it is regarded as the first
theorem in graph theory. Euler discovered that the possibility of such a walk is
determined by the degrees of the vertices rather than by the arrangement of the
bridges. A required requirement for such a walk (an Eulerian path) to exist is for
zero or two vertices to have an odd degree and all others to have an even
degree. Because each landmass in Konigsberg has an odd number of bridges, it
was demonstrated that no such trek could happen.

Lesson 3. Graph Coloring

Highlights

A. Give a summary of the Greedy Algorithm.

The greedy algorithm is a basic, intuitive problem-solving strategy that focuses

on selecting the locally optimal decision at each stage in the hopes that these
local solutions will lead to a global optimum. While it does not always produce
the global optimum, it is efficient and effective for a wide range of situations.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

Dijkstra's algorithm for shortest paths in graphs, as well as the Kruskal and Prim
algorithms for finding minimal spanning trees, are examples of its applications.

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

The Edge-Picking algorithm is a common strategy in graph theory. While there is

no uniform "Edge-Picking algorithm," the fundamental idea is to choose edges
methodically based on particular criteria to solve an issue. The details of the
edge-picking technique will differ depending on the problem. This method is
frequently used in graph optimization problems such as determining the
maximum or minimum spanning tree, shortest path, or other optimization
problems.

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

The assignment of labels (represented by colors) to vertices of a graph G in such

a way that no two adjacent vertices have the same color is known as graph
coloring. Many practical applications of graph coloring exist, including scheduling
difficulties, register allocation in compilers, and solving Sudoku puzzles.
Determining the smallest number of colors for a graph, known as the graph's
chromatic number, is a large computing task and is classified as an NP-hard
problem in theoretical computer science.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10