Guided Noteboo Kin GED10 2 (Mathe Matics in The Modern World)

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
Graph in graph theoretic context is much simplified as consisiting of points or

vertices and line segments called edges and has no regard to coordinates and
distances.
2. Degree of a vertex
This is the number of edges incident to it, or equivalently, the number of

vertices that are adjacent to it.
3. Isomorphic graphs
Graphs which contain the same number of graph vertices connected in the
same way are said to be isomorphic. Formally, two graphs and with graph vertices
are said to be isomorphic if there is a permutation of such that is in the set of graph
edges iff is in the set of graph edges .
B. Give 4 types of graphs and give a brief description (you may describe in
words or just draw a sample graph).
1. Directed graphs
In mathematics, and more specifically in graph theory, a directed graph is a

graph that is made up of a set of vertices connected by edges, where the edges
have a direction associated with them.
2. Multigraph
A multigraph is a graph which is permitted to have multiple edges, that is,

edges that have the same end nodes. Thus two vertices may be connected by more
than one edge.
3. Null graph
The term "null graph" may refer either to the order-zero graph, or
alternatively, to any edgeless graph.
4. Complete graphs
A complete graph is a simple undirected graph in which every pair of distinct

vertices is connected by a unique edge. A complete digraph is a directed graph in
which every pair of distinct vertices is connected by a pair of unique edges.
Lesson 2. Eulerian and Hamiltonian Graphs, Weighted Graphs
Highlights
A. Define the following:

1. Walk
-a sequence of adjacent vertices
2. Path, Trail
Path- a walk that has no repeated vertex
Trail- a walk that does not have repeated edges
3. Cycle, Circuit
Cycle- a closed path

Circuit- a closed trail
B. What is Eulerian Graph?
A graph that contains an Eulerian circuit. It is both connected and has a

closed trail (a walk with no repeated edges) containing all edges of the graph.
C. What is Hamiltonian Graph?
A graph that has a Hamiltonian cycle. It contains a closed path that traverses
all the vertices of the graph, which each vertex being traversed only once.
D. Describe how to solve the Konigsberg Problem.
It isn't possible to solve the bridge problem if there are four vertices with an
odd degree. According to Euler's proof, we could only solve it if either all the
vertices in the graph were even, or if only two of the vertices were odd.
A Eulerian path that visits each edge only once is only possible in one of two
scenarios. The first is when there are exactly two nodes of odd degree, meaning all
the rest are even. There, the starting point is one of the odd nodes, and the end
point is the other. The second is when all the nodes are of even degree. Then, the
Eulerian path will start and stop in the same location, which also makes it
something called a Eulerian circuit. It turns out history created a Eulerian path of its
own. During World War II, the Soviet Air Force destroyed two of the city’s
bridges,making the Eulerian path easily possible.
Lesson 3. Graph Coloring
Highlights
A. Give a summary of the Greedy Algorithm.
A greedy algorithm is a simple, intuitive algorithm that is used in

optimization problems. The algorithm makes the optimal choice at each step as it
attempts to find the overall optimal way to solve the entire problem. Greedy
algorithms take all of the data in a particular problem, and then set a rule for which
elements to add to the solution at each step of the algorithm. The set of data is all
of the numbers in the graph, and the rule was to select the largest number
available at each level of the graph. The solution that the algorithm builds is the
sum of all of those choices.
B. Give a summary of the Edge-Picking Algorithm.

The edge-picking algorithm marks the edge that has the smallest weight in
the complete graph. Then, the edge with the next smallest weight is marked as
long as it does not complete a circuit and does not add a third marked edge to a
single vertex.
C. What is a graph coloring, and how is it applied?
Graph coloring is the procedure of assignment of colors to each vertex of a

graph G such that no adjacent vertices get same color. The objective is to minimize
the number of colors while coloring a graph. The smallest number of colors required
to color a graph G is called its chromatic number of that graph. It is another aspect
of graph labeling. Here, the main objective is to color the vertices of the graph with
the least possible number of colors such that no two adjacent vertices share the
same color. Although this may appear just yet another tricky mathematical
problem, graph coloring has found its way into countless applications of practical
values. The accelerated interest in graph theory can be attributed to graph coloring.
In fact, it took almost a hundred years for a classical problem to be settled—the
Four Color Theorem. It states that if a graph can be drawn such that its edges do
not intersect, then it takes no more than four colors for its vertices to be colored
(again, no two adjacent vertices share the same color).

Guided Noteboo Kin GED10 2 (Mathe Matics in The Modern World)

Uploaded by

Copyright:

Available Formats

Guided Noteboo Kin GED10 2 (Mathe Matics in The Modern World)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Guided Noteboo Kin GED10 2 (Mathe Matics in The Modern World)

Uploaded by

Copyright:

Available Formats

Guided

(Mathe applications and the theoretical treatment of the

matics The topics are grouped into three lessons: Graph

in the Keep track of your progress in this lesson by

___/__ 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

A. Give a brief definition of the following:

Graph in graph theoretic context is much simplified as consisiting of points or

This is the number of edges incident to it, or equivalently, the number of

In mathematics, and more specifically in graph theory, a directed graph is a

A multigraph is a graph which is permitted to have multiple edges, that is,

A complete graph is a simple undirected graph in which every pair of distinct

Lesson 2. Eulerian and Hamiltonian Graphs, Weighted Graphs

A. Define the following:

-a sequence of adjacent vertices

Path- a walk that has no repeated vertex

Trail- a walk that does not have repeated edges

Cycle- a closed path

Circuit- a closed trail

B. What is Eulerian Graph?

A graph that contains an Eulerian circuit. It is both connected and has a

C. What is Hamiltonian Graph?

D. Describe how to solve the Konigsberg Problem.

Lesson 3. Graph Coloring

A. Give a summary of the Greedy Algorithm.

A greedy algorithm is a simple, intuitive algorithm that is used in

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

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

Graph coloring is the procedure of assignment of colors to each vertex of a

You might also like

_/ 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

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

_/ 6. Accomplish HW10 in BB.

_/ 10. Submit WGN 10.