MALAYSIA

MUADZAM SHAH

SESSION I : 2021/2022
DEPARTMENT : JMSK
ASSESSMENT : CASE STUDY (GRAPHS & TREES)

CODE COURSE: DBM20083

COURSE NAME: DISCRETE MATHEMATICS

PROGRAMME : DDT SEMESTER : 213141516

DATE TIME HOURS
INSTRUCTION TO CANDIDATES:

NAME : LYZA SAPARUDIN

REG. NO. : 19DDT20F2021

PROGRAMME : DDT

LECTURER : PUAN SITI HUZAIFAH BINTI MOHAMMAD

This paper contains 6 printed pages (including the front page)

Prepared by: Verified by:

(Lecturer ) Pensyarah DH44

SITI HUZA
(Head of Department/Head of Programme/
Jabatan Matemztik, Sains dan Komputer AH BINTI
Head of Course / Course Coordinator)
Politeknik Muadzam Shah
Pahang Darul Makmur

Date: 11/ 11/002/ Date: 11-11.2021

MOHAMMAD

KrnpuY
 REPORT FOR DISCRETE MATHEMATICS

GRAPHS AND TREES

PREPARED FOR

PUAN SITI HUZAIFAH BINTI MOHAMMAD

REPORT PREPARED BY

NUR AQILAH BT ZAINOL AKRAMIN

(19DDT20F2020)

LYZA BT SAPARUDIN

(19DDT20F2021)
CONTENT OF REPORT

1) ABSTRACT
• State the problem
• Aim of the report

2) INTRODUCTION
• Detail of the problem
• Aim of the case study

3) METHODOLOGY
• Explain how Graph Teory/Tree Theory is used to solve the problem
• Identify solution to the problem and explain the reason
• Explain the steps and show the calculation involved

4) CONCLUSION/RESULTS
• Summarize result

5) REFERENCES
List of books, journals as well as any online research material

6) APPENDICES
All charts, visuals and other related items use in writing the report
1. Abstract
• State the problem
- One Direction needs to plan their route for the Asia Tour on November 1st –
November 20th
- How to draw a directed graph to represent One Direction route from Singapore –
Malaysia – Indonesia – Thailand - Philippines
- Based on the graph, calculate minimum distance in km to connect each place using
Kruskal Algorithm

• Aim of this report

- To understand about Kruskal Algorithm better.

2. Introduction
• Detail of the problem
- One Direction needs to go to those 5 places in Southeast Asia in 20 days period of
time. So, they need to plan their journey wisely to make sure the time they spend on
the road doesn’t effect their concert.
- In order to solve this problem, use Kruskal’s Algorithm to connect each place and
calculate the minimum distance in km

• Aim of the case study

- To find the shortest distance between one place to another
- To draw a directed tree with minimum total weight and show every place being
visited exactly once

3. Methodology
• Explain how Graph Teory/Tree Theory is used to solve the problem
- For graph A, i write down all the possible route that connect each place so I can see
which route I should take to minimize the total weight
- For graph B, I use minimum spanning tree using Kruskal’s Algorithm. Kruskal’s
Algorithm also constructs the minimum spanning tree of a graph by adding edges to
the spanning tree one by one

• Identify solution to the problem and explain the reason

- The solution is to construct a graph that show all routes that connect to every vertex
- Using Kruskal Algorithm, find a minimum spanning tree to calculate their journey in
kilometre as smallest weight as possible
- The reason of using Kruskal Algorithm is because the method is to find the smallest
weight first and connect the graph using any route as long as there isn’t any loops
- It matched with the agenda which is to, find the shortest routes so One Direction
can save time and to not effecting their concert
 • Explain the steps and show the calculation involved
i. Find the edge in the graph with smallest weight (if there is more than one, pick
one at random)
ii. Find the next edge in the graph with smallest weight that doesn’t close a cycle.
Color that edge and the next incident vertex.
iii. Repeat step 2 until you reach out to every vertex of the graph. The chosen edges
form the desired minimum spanning tree

4. Conclusion/Result

5. References
• Ebook Discrete Mathematics For Polytechnics
• Slide Chapter 3
• Discrete Mathematics | Hasse Diagrams - GeeksforGeeks
6. Appendices