19/3/2023
MAT668: GRAPH THEORY
ZATI AQMAR ZAHARUDIN
012 336 2155
FSKM, UiTM SEREMBAN
1
19/3/2023
2
19/3/2023
3
19/3/2023
Graph?
4
19/3/2023
10
5
19/3/2023
CHAPTERS
1. Definitions and Fundamental Concepts
Basic definitions, operations, properties and proof styles.
Traversability Problems in Graphs
2. Trees and Distance
Properties, distances and centroids, spanning trees and enumeration, optimization and trees.
Applications and algorithms.
3. Matchings and Factors
Weighted, maximal, maximum and perfect matching.
Theorems, applications and algorithms.
4. Connectivity and Paths
Cuts and connectivity, k-connected graphs and network flows.
Theorems, applications and algorithms.
5. Graph Colouring
Colour theorems, vertex and edge colouring problems, and colouring applied to assignment and
scheduling problems.
6. Planar Graphs
Characterization of planar graphs, properties, parameters and testing of planarity, embeddings and
Euler's formula
(theorem), plane duality (dual graphs) and graphs of polyhedral,.
Applications and algorithms.
11
CHAPTER 1.
Definitions and Fundamental Concepts
By the end of chapter, you should be able to:
1. Describe fundamental definitions and
concepts of graph theory.
2. Explain basic definitions, operations,
properties and proof styles.
3. Solve traversability problems in graphs.
12
6
19/3/2023
1. Graph Basics and Definitions
Vertices/Nodes, Edges
2. Adjacency & Degree Sequences
Directed & undirected graphs
3. Graph Representations
Adjacency list, Adjacency Matrix, Incidence Matrix
4. Isomorphism
5. Types of Graphs
Null graph, Complete graph, Cycle graph, Path graph, Wheels, Regular graph, Platonic, n-Cubes, Bipartite,
Complete Bipartite
6. Operations and properties
Subgraphs, Unions, Adding and Removing edges, edge contractions, removing vertices, complement
7. Traversability: Walk, Path, Cycles and Trails
8. Eulerian Graph
9. Hamiltonian Graph
10. Weighted Graph
13
1. Graph Basics and Definitions
Definition 1:
14
7
19/3/2023
15
Definition 2
16
8
19/3/2023
17
TRY:Past Year January 2019 Q1(b)
18
9
19/3/2023
2. Adjacency & Degree Sequences
Undirected Graph
Definition 3
Definition 4
Definition 5
Definition 6
19
20
10
19/3/2023
TRY: Past Year December 2019, Q2(a)
21
Theorem 1
Example 5
22
11
19/3/2023
Theorem 2
Example 6
23
TRY:Tutorial 1, Q1(c) & Q2(b)
Past Year January 2019 Q6(c)
ANSWER:
Tutorial 1 Q1(c) – LHS 2m = 2(10) = 20
RHS 2+2+2+2+3+3+3+3 =20
Therefore, handshaking lemma is verified.
Tutorial Q2(b) – LHS 2m = 2(8) = 16
RHS 2+2+3+3+3+3 =16
Therefore, handshaking lemma is verified.
Past Year January 2019 Q6(c) – Number of vertices 7 LHS 2m = 2(11) = 22
Number of edges 11 RHS 2+3+3+3+3+4+4 =22
Degree Sequence (2,3,3,3,3,4,4) Therefore, handshaking lemma is verified.
24
12
19/3/2023
Directed Graph
Definition 7
Definition 8
Theorem 3
25
Example 7
26
13
19/3/2023
TRY: Past Year January 2019, Q2(a)
27
TRY: Tutorial 1, Q1(d-i) & Q2(c)
ANSWER:
Tutorial 1 Q1(d-i) – 5
Tutorial Q2(c-i) – Vertex Set {1,2,3,4,5,6} (c-ii) Degree Sequence (1,1,2,2,3,3)
Edge Set {{1,4,},{4,2},{2,5},{5,2},{5,3},{3,6}} Max deg. 3
Min deg. 1
28
14
19/3/2023
3. Graph Representations
Adjacency
list
29
Adjacency
Matrix
30
15
19/3/2023
31
32
16
19/3/2023
33
TRY: Tutorial 1 Q1(a-ii), Q2(a) & Q2(f)
ANSWER:
Tutorial 1 Q1(a-ii) – No since (i) loop at vertex B, and (ii) two edges between A-C.
Tutorial Q2(a) – Yes since contains multiples edges between two vertices and has loops.
a b c d e
Tutorial Q2(f) – a 1 1 0 0 1
b 1 0 0 0 0
c 0 1 0 1 0
d 0 1 1 0 0
e 1 0 0 0 1
34
17
19/3/2023
Incidence Matrix
35
36
18
19/3/2023
TRY: Past Year January 2019 Q1(a)
37
TRY: Past Year December 2019 Q1(a)
38
19
19/3/2023
4. Isomorphism
39
40
20
19/3/2023
41
42
21
19/3/2023
43
44
22
19/3/2023
45
TRY:Tutorial 1 Q1(e) & Q2(e)
Past Year January 2019 Q2(c)
Past Year December 2019 Q2(c)
ANSWER:
Tutorial 1 Q1(e) – Yes; Q2(e) – Yes
Jan 2019 Q2(c) – No; Dec 2019 Q2(c) – Yes
46
23
19/3/2023
5. Types of Graphs
Null graph
47
Complete graph
48
24
19/3/2023
Cycle graph, Path graph and Wheels
49
Regular graph
50
25
19/3/2023
Platonic graphs
51
k-Cubes
52
26
19/3/2023
Bipartite
53
Complete Bipartite
54
27
19/3/2023
TRY:Past Year December 2019 Q1(b)
55
6. Operations and properties
Subgraphs
56
28
19/3/2023
Adding and Removing edges, Removing vertices
57
Edge contractions
58
29
19/3/2023
Unions
Examples
59
Complement
60
30
19/3/2023
7.Traversability: Walk, Path, Cycles and Trails
61
Example
62
31
19/3/2023
Example
63
TRY:Tutorial 1 Q1(d-ii), Q2(d) & Q2(g)
ANSWER:
Tutorial 1 Q1(d-ii) – Yes; 1→2→6; 1→4→2→6.
Tutorial Q2(d) – E→B→C→B is not directed path as no edge between E-B.
Tutorial Q2(g) – c→e; c→d→b→e; c→a→e; c→d→b→a→e (or any reasonable answers)
64
32
19/3/2023
8. Eulerian Graph
65
Example
66
33
19/3/2023
9. Hamiltonian Graph
67
68
34
19/3/2023
TRY: Tutorial 1, Q1(b)
ANSWER:
Tutorial 1 Q1(b) – Graph A(i); Graph B(iv)
69
70
35
19/3/2023
10. Weighted Graph
71
Example
Find the distance matrix for the given weighted graph.
72
36