FACULTY OF COMPUTER AND MATHEMATICAL SCIENCES

SCHEME OF WORK

Week Topics and Sub-Topics No. of Hours Remarks

1 Definitions and Fundamental Concepts 3
• Graph Basics and Definitions
⁻ Vertices/Nodes, Edges, Adjacency, Incidence
⁻ Degree, In-Degree, Out-Degree
⁻ Subgraphs, Unions, Isomorphism
⁻ Adjacency Matrices
⁻ Degree Sequences
• Walk, Path, Cycles and Trails Pg 35: Fig
• Vertex Degrees and Counting 2.25
Tutorial 1

2 Definitions and Fundamental Concepts (cont.) 3

• Types of Graphs Pg 32:
⁻ Trees, Undirected graphs, Simple graphs,
Multigraphs, Pseudographs. Directed Graphs
(Digraphs), Directed Multigraphs, Regular, Bipartite
and Complete Graphs, Cycles, Wheels, Cubes,
Complete Bipartite
• Operations and properties Pg 26 : 2.7
• Proof styles
Tutorial 1
Pg 36
3 Definitions and Fundamental Concepts (cont.) 2
• Traversability Problems in Graphs: Pg 28: 2.8
Königsberg Bridge problem and Eulerian graphs, Pg 30: 2.9
Hamiltonian circuits and paths, and applications of
Eulerian and Hamiltonian Graphs
-Theorem Euler Graph
-Theorem Semi Euler Graph

Tutorial 1 Pg 36
Laboratory 1 Pg 39: 3.1-
4 Trees and Distance 3 3.2
• Basic Properties Pg 45: 3.4
• Distances and centroids Pg 55: 3.7
• Spanning Trees Pg 58: 3.9
• Matrix Tree Computation and Enumeration. Pg 61: 3.10
o Kirchoff’s theorem (Matrix tree theorem) Pg 52: 3.6
o Theorem Cayley

Tutorial 1

Tahun Mula: APRIL

Nama Fakulti: Fakulti Sains Komputer dan Matematik
2020
Tahun Semakan: 2020
Pusat Pengajian: Matematik 2008, 20112008,
(RWA)
© Hak Cipta Universiti Teknologi MARA
 Week Topics and Sub-Topics No. of Hours Remarks
5 Trees and Distance(cont.) 2
• Optimization and Trees
o Minimum Cost Spanning Tree, Prim’s and
Kruskal’s Algorithms, the Shortest Path
Algorithms, Dijkstra’s algorithm
o Applications of Minimum Spanning Trees,
Shortest Paths, Dijkstra’s Algorithm, and
Chinese Postman Problem.

Assignment 1

Tutorial 1
Laboratory 1
6 Matchings and Factors 2
- Matchings
- Perfect, weighted, maximal and maximum matching
- Hall’s Theorem – Hall’s Marriage Theorem
- Min-Max Theorem (Cover)
o Vertex cover
o Edge cover
o König’s Theorem
- Matchings in General Graphs
- Tutte’s 1-factor Theorem (Perfect Matching)
Tutorial 1
Laboratory 1
7 Matchings and Factors (cont.) 1.5
• Algorithms and applications
- Assignment Problems
- Hungarian Algorithm.

Connectivity and Paths

• Cuts and Connectivity
- vertex cut, cut-vertex
- edge cut, cut-edges (bridge)
-cutset

-Whitney’s Theorem
• The Minimal Connector problem
• Blocks and k-connected graphs

Tutorial 1

TEST 1 1.5

Tahun Mula: APRIL

Nama Fakulti: Fakulti Sains Komputer dan Matematik
2020
Tahun Semakan: 2020
Pusat Pengajian: Matematik 2008, 20112008,
(RWA)
© Hak Cipta Universiti Teknologi MARA
 Week Topics and Sub-Topics No. of Hours Remarks
8 Connectivity and Paths (cont.) 3
• Network Flow Problems, Max-Flow/Min-Cut Theorem Pg153 -
and Ford-Fulkerson Labeling Algorithm Graduate
o Theorem Ford-Fulkerson texts.
• Eg: PERT and Critical Path Method To highlight
• Eg: Transportation and scheduling problems examples,
for review
Tutorial 1 only
Assignment 2

9 Connectivity and Paths (cont.) 2

• Applications of flow problems to water, oil, and electric

distribution systems (circuits)

Tutorial 1
Laboratory 1

10 Graph Colouring 3
• Colour Theorems.
o Brooks Theorem
o Upper bound, lower bound
• The Four / Five Colour Problems Vertex and Edge
Colouring Problems
• Hamiltonian Cycles, Chromatic Polynomials
• k-Chromatic graphs, Upper Bounds and Enumerative
Aspects
o Upper bound- maximum degree
• Clique
Tutorial 1
Assignment 3

11 Graph Colouring (cont.) 2

• Vertex and edge colouring problems and colouring
applied to scheduling problems.
• Eg: The Four Colour problems, assignment and
scheduling problems, physical layout problem, Pg 34 : 2.10
timetabling, transportation problems

Tutorial
1
Laboratory
1

Tahun Mula: APRIL

Nama Fakulti: Fakulti Sains Komputer dan Matematik
2020
Tahun Semakan: 2020
Pusat Pengajian: Matematik 2008, 20112008,
(RWA)
© Hak Cipta Universiti Teknologi MARA
 Week Topics and Sub-Topics No. of Hours Remarks
12 Planar Graphs 3 To highlight
• Characterization of Planar Graphs examples,
• Embeddings and Euler's Formula for review
• Properties, Parameters and Testing of Planarity only
• Planar Graphs: Kuratowski's Theorem and Graph
Minors Colouring
• Eg: Plane Duality or Dual Graphs and Graphs of
polyhedral.
Brainstorming on Project Framework
Tutorial 1

13 Planar Graphs (cont.) 1.5 To highlight

• Applications: examples,
- Display of graphical data, i.e., flowcharts, for exposure
organisational charts and scheduling conflicts, only
- Design problems for circuits, subways and utility
lines
- Algorithms for shortest paths in planar graphs

TEST 2 1.5
Tutorial
1
14 Laboratory: Working on Project 2

Review of Selected Topics (for Final exam) 2

Completing and submission of Assignment 2
15 Final Assessment

Tahun Mula: APRIL

Nama Fakulti: Fakulti Sains Komputer dan Matematik
2020
Tahun Semakan: 2020
Pusat Pengajian: Matematik 2008, 20112008,
(RWA)
© Hak Cipta Universiti Teknologi MARA