FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

Task List

The goal of this week’s lesson is to introduce you to the bread area of Graph
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 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 Coloring.

Keep track of your progress in this lesson by checking the number corresponding to
each task.

___✔__ 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.

FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

Lesson 1. Modelling with Graphs

Highlights

A. Give a brief definition of the following:

1. Graph - A graph is made up of line segments and points known as vertices.
vertices connected by edges. A graph, sometimes abbreviated as G,
includes two crucial parts: V, which stands for "vertices" (or "nodes"),
E is a collection of edges (or lines). Graph is a type of data visualization
that shows the connection between various variables or data points. It
consists of nodes or vertices, usually referred to as data points, that are
connected by lines or edges. Graphs are utilized to communicate intricate
patterns, connections, and interactions in an easy-to-understand way.

2. Degree of a vertex – is the number of nearby vertices, or alternatively, the

number of adjacent edges consequent to it. It is is described as the quantity
of edges joining that vertex. It stands for the number of surrounding edges
connected to a specific node or point in the graph, to put it another way.

3. Isomorphic graphs - are graphs that, despite having a different appearance

when graphically depicted or drawn, contain the same fundamental
structure. To put it another way, two graphs are said to be isomorphic if
they share the same connectivity patterns and have the same quantity of
vertices, but have different labels or names for the vertices and edges.
Simply described, isomorphic graphs are the same graph with different
labels or arrangements for the vertices and edges. They maintain the
connections and links between the vertices.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

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

Directed Graphs - A mathematical structure, also known as a digraph, is made up

of a collection of vertices (or nodes) and a set of directed edges (or arcs)
connecting these vertices. Directed graphs include edges that transmit a specified
direction from one vertex to another, in contrast to undirected graphs where
edges indicate symmetric interactions between nodes.

Multigraph - is a sort of mathematical graph where the same pair of vertices might
have numerous edges connecting them. In other words, it allows for parallel edges
to exist. Multi-graphs can have two or more edges linking the same pair of nodes,
in contrast to simple graphs, where any two vertices can only have one edge.

Null graph - also known as the empty graph, is a simple graph that contains no
vertices and no edges. In other words, it is the simplest possible graph
representation with no elements. The null graph is denoted by the symbol "ϴ" or
sometimes "N" and is characterized by having a vertex set V(ϴ) = {} and an edge
set E(ϴ) = {}.

Paths - is a straightforward graph made up of a straight line-shaped edge

connecting each vertex in a linear chain. One of the basic graph structures used
in graph theory is this one. With the exception of the endpoints, which have only
one neighboring vertex, each vertex in a path graph is connected to both the
preceding and following vertices in the series.

HW 10 Item #1 (No. 4, pp. 194-195, MMW Textbook)

FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

Lesson 2. Eulerian and Hamiltonian Graphs, Weighted Graphs

Highlights

A. Define the following:

1. Walk - is a finite series of edges and vertices in a graph, where each edge's
endpoints relate to a series of vertices. It permits using the same edge more
than once and returning to vertices. In other terms, a walk is a path with
repeated vertices and edges that may or may not be unique. The number of
edges the stroll crosses determines how long it is.

2. Path, Trail - Unrepeated vertices or edges distinguish a path from other types
of walks. The edges that link one vertex in the graph to another are a series
of distinctive vertices and vertices. In the simplest words, a path is a non-
repeating collection of vertices and edges that creates a singular route from
one vertice to the next.

In a graph, a trail is a walk that, with the exception of the beginning and
finishing vertices if they coincide, may have repeated edges but no repeated
vertices. In other words, a trail may traverse the same edge more than once,
but it shouldn't return to the same vertex (unless it serves as the trail's
beginning and end). While trails still adhere to the restriction of no vertex
repetition (aside from the start and end), they are less restrictive than
pathways in terms of edge repetition.

3. Cycle, Circuit - A cycle is a closed walk in a graph where all of the edges and
vertices are unique (aside from the cycle's shared starting and finishing
vertices), and the cycle's starting and ending vertices are the same. In plain
English, a cycle is a path that forms a loop by passing through a series of
unique vertices and edges and beginning and ending at the same vertex.

In a graph, a circuit is a closed walk that could have repeating vertices and
edges. Similar to a cycle, it starts and ends at the same vertex, but it also
permits returning vertex locations and repeatedly employing the same edge.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

A circuit essentially is a mellowed-out cycle that still forms a loop but allows
for repetitions.

B. What is Eulerian Graph?

It is a particular kind of graph that has an Eulerian circuit, which is a closed walk
that begins and ends at the same vertex and travels down every edge of the graph
precisely once. In other words, an Eulerian graph has a circuit that traverses every
edge exactly once, without repeating any edges. This enables a continuous tour
of the graph. It has the name of the Swiss mathematician Leonhard Euler, whose
discoveries in graph theory and solution of the infamous Königsberg Seven
Bridges puzzle served as the impetus for the study of Eulerian graphs.

C. What is Hamiltonian Graph?

It is a particular kind of graph that has a closed walk known as a Hamiltonian
cycle that visits each vertex of the graph precisely once before returning to the
beginning vertex. In other words, a Hamiltonian graph has a cycle that traverses
every vertex exactly once, allowing for a continuous tour of the graph that passes
through all the vertices without repetition. It bears the name Sir William Rowan
Hamilton after the Irish mathematician who made significant contributions to the
study of cycles in graphs. In computer science and combinatorial optimization,
the determination of Hamiltonian cycles in graphs is a well-known NP-complete
issue.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

D. Describe how to solve the Konigsberg Problem.

the travel is impractical since 3 + 2 + 2 + 2 = 9, which is greater than 8. This

graph has four vertices of odd degree, so it is impossible to have an Eulerian path,
or a path where each edge is utilized only once. However, 4 + 2 + 2 + 2 + 3 + 3
= 16, which equals the number of bridges plus one, demonstrates that the voyage
is in fact feasible. Euler asserted that there is absolutely no path over the
Königsberg bridges based on this justification.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

HW 10 Items #2 and #3 (No. 2, p. 204, No. 3, p. 216)

Lesson 3. Graph Coloring

Highlights

A. Give a summary of the Greedy Algorithm.

The greedy algorithm is a straightforward, intuitive method used to solve

optimization issues. The algorithm seeks to identify the overall optimal solution
to the entire problem, making the best decision at each step. Greedy
algorithms are highly effective in solving some problems, such as data
compression using the Huffman encoding or graph traversal using the Dijkstra
method.

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

The edge-picking algorithm instructs users to mark the edge in the entire graph
with the minimum weight. As long as it does not complete a circuit or add a
third marked edge to a single vertex, the edge with the next-smallest weight
is then marked. This process keeps going until there is no longer an edge that
can be marked.
FIRST QUARTER, SY2020-2021 GED 102 WEEK 10

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

Graph coloring is a specific type of graph labeling that involves applying certain
restrictions on the assignment of labels sometimes referred to as "colors" to
various graph elements. Vertex coloring, in its most basic form, is the process
of coloring a graph's vertices so that no two neighboring vertices have the
same color. The most typical graph coloring issue is vertex coloring. The
challenge is to determine how to color a graph's vertices so that no two
neighboring vertices share the same color, given m colors. Edge Coloring (No
vertex is incident to two edges of the same color) and Face Coloring
(Geographical Map Coloring) are two further graph coloring issues that can be
converted into vertex coloring.

Answer HW 10 Items #4 and #5 (No. 1, p. 225, No. 3, p.226)