Graph

Module Summary
Module learning objective
• Identity trees and obtain spanning trees of graphs.
• Recognize Planar graph and apply Euler’s
formula to determine planarity.
• Find Euler and Hamiltonian paths and circuits in a graph.
Summary of content
Reflection on the Content

What is the most important thing you learned in this module?

The most important thing I learnt in this module is DFS & BFS.
I think so because it contains the most time consuming and
conceptually important questions. It took me some time to
revise and completely grasp the concept.

How does this relate to what you already know?

It greatly relates to the things learnt in the previous modules.

I believe that one cannot completely grasp Fleury’s Algorithm
without having basic knowledge of Euler Paths & Circuits.

Why do you think your course team wants you to learn the
content of this module?

I think the content team wants us to learn the content of this

module to make our foundations strong before exposing us to
more difficult concepts. Moreover, I also believe that the
concept of Euler paths & circuits is important in programming,
as helps solve the problems in networking. So, I think that the
content team want us to master concepts relating to logic to
help us in the future.
Applications of Graph Theory:

Computer Science

• Networks and Communication: Routing mechanisms such

as Dijkstra and Bellman-Ford in computer networks.

• Modeling Internet structures.

Data Structures:

• Appliction of a graph to depict relations among entities in

a database.

Algorithms:

• Game pathfinding with AI or pathfinding algorithms (A*

etc.).

• Resolving the order of tasks or programming elements

(inside compilers, schedulers, etc.).

Engineering

• Electrical Networks: Circuit design and current flow results’

calculations.

• Transport Systems: Improving logistics and transport

routing.
Evidence of Learning:
11/23/24, 3:51 PM Graph Theory (Core)

Graph Theory (Core)

Click on a question number to see how your answers were marked and, where
available, full solutions.

Question Number Score

Trees
Question 1 3 / 3
Question 2 1 / 2

Euler Paths and Circuits

Question 3 4 / 4
Question 4 4 / 4
Total 12 / 13 (92%)

Performance Summary
Exam Name: Graph Theory (Core)
Session ID: 01297079379
Exam Start: Sat Nov 23 2024 15:42:20
Exam Stop: Sat Nov 23 2024 15:51:54
Time Spent: 0:09:33

Question 1
Consider the following graphs over the vertices {a, b, c, d, e, f}.

Which of them are trees?

b f
{[ , ] , [ , c d]}

file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 1/7
11/23/24, 3:51 PM Graph Theory (Core)

True False

Expected answer:

True False

e f
{[ , ] , [ , b d] , [d, f] , [a, f] , [c, f]}

True False

Expected answer:

True False

b f
{[ , ] , [ , c e] , [b, d] , [b, c] , [c, f]}

True False

Expected answer:

True False


Gap 0
 You chose a correct answer. You were awarded 1 mark.
Gap 1
 You chose a correct answer. You were awarded 1 mark.
Gap 2
 You chose a correct answer. You were awarded 1 mark.
You scored 3 marks for this part.

Score: 3/3 

Advice
1. The first graph is not a tree as it does not contain the expected number of edges.
file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 2/7
11/23/24, 3:51 PM Graph Theory (Core)

2. The second graph is a tree.

3. The third graph is not a tree as it is not connected.

Question 2
Find spanning trees for the following graphs over the vertices {a, b, c, d, e, f}. Enter
your solution as the list of edges, using square brackets - such as [[a,b],[c,d]].

First Graph
Enter a spanning graph for the graph with edges
[[ ,a b] , [b, c] , [b, d] , [b, e] , [c, d] , [d, e] , [d, f]] :

[[a,b],[b,c],[b,d],[d,e],[d,f]] [[a, b] , [b, c] , [b, d] , [d, e] , [d, f]]


Expected answer:
[ [ "a", "b" ], [ "b", "c" ], [ "b", "d" ], [ "b", "e" ], [ "

a b] , [b, c] , [b, d] , [b, e] , [d, f]]

[[ ,

 The graph you entered forms a spanning tree of the original

graph. You were awarded 1 mark.
You scored 1 mark for this part.

Score: 1/1 

Second Graph
Enter a spanning graph for the graph with edges
[[ ,a b] , [a, d] , [a, e] , [b, c] , [b, d] , [b, f] , [c, d] , [c, f]]:

[[a,b],[a,d],[b,c],[b,f],[d,f]] [[a, b] , [a, d] , [b, c] , [b, f] , [d, f]]

file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 3/7
11/23/24, 3:51 PM Graph Theory (Core)


Expected answer:
[ [ "a", "b" ], [ "b", "c" ], [ "b", "d" ], [ "b", "e" ], [ "

[[ ,a b] , [b, c] , [b, d] , [b, e] , [d, f]]

 Your grah is not a subgraph of the original graph!

You scored 0 marks for this part.

Score: 0/1 

Advice
1. A possible spanning tree for the first graph is
[[ , a b] , [b, c] , [b, d] , [b, e] , [d, f]] .
2. A possible spanning tree for the first graph is
[[ b] [ d] [ ] [ d ] [ f]]

Question 3
Consider the following graphs over the vertices {a, b, c, d, e, f}.

Which of them contain Euler paths?

a)
[[ , f b] , [b, a] , [a, c] , [a, d] , [a, f] , [b, e] , [c, d] , [c, f] , [d, e]]

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 4/7
11/23/24, 3:51 PM Graph Theory (Core)

Expected answer:

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

 You chose a correct answer. You were awarded 2 marks.

You scored 2 marks for this part.

Score: 2/2 

b)
a e] , [a, f] , [b, e] , [b, f] , [c, d] , [c, f] , [d, f]]
[[ ,

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.


Expected answer:

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

 You chose a correct answer. You were awarded 2 marks.

You scored 2 marks for this part.

Score: 2/2 

file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 5/7
11/23/24, 3:51 PM Graph Theory (Core)

Advice
1. The degrees of the vertices in the first graph are [4, 3, 3, 3, 2, 3]. The number of
vertices with an odd degree is 4. Since 4 ≥ 2, it doesn't contain Euler paths,Since
4 ≠ 0, it doesn't contain Euler circuits,

2. The degrees of the vertices in the first graph are [2, 2, 2, 2, 2, 4]. The number of
vertices with an odd degree is 0. Since 0 ≤ 2, it contains Euler paths, and since there
are no odd-degree vertices, it also contains Euler circuits,

Question 4
Consider the following graphs over the vertices {a, b, c, d, e, f}.

Which of them contain Euler paths?

a)
b e] , [a, c] , [b, c] , [b, d] , [b, f] , [d, e]]
[[ ,

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

Expected answer:

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

 You chose a correct answer. You were awarded 2 marks.

You scored 2 marks for this part.

Score: 2/2 

b)
file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 6/7
11/23/24, 3:51 PM Graph Theory (Core)

[[ ,a b] , [a, d] , [a, e] , [c, d] , [e, f]]

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.


Expected answer:

Contains a Euler path Contains a Euler Circuit

Contains both Contains neither.

 You chose a correct answer. You were awarded 2 marks.

You scored 2 marks for this part.

Score: 2/2 

Advice
1. The degrees of the vertices in the first graph are [1, 4, 2, 2, 2, 1]. The number of
vertices with an odd degree is 2. Since 2 ≤ 2, it contains Euler paths,Since 2 ≠ 0, it
doesn't contain Euler circuits,
2. The degrees of the vertices in the first graph are [3, 1, 1, 2, 2, 1]. The number of
vertices with an odd degree is 4. Since 4 ≥ 2, it doesn't contain Euler paths,Since
4 ≠ 0, it doesn't contain Euler circuits,

Created using Numbas (https://www.numbas.org.uk), developed by Newcastle University

(http://www.newcastle.ac.uk).

file:///C:/Users/HP/Downloads/Discrete Mathematics - 11232024 - 1143 AM/6. Core Module-5-Graphs-Self-Assessment/6. Core Module-5-Graphs-… 7/7
REFERENCES:
1. Discrete Mathematics and Its Applications, Kenneth H.Rosen,
Seventh Edition, Pages 641 to 727
2. Discrete Maths, 3rd Edition - Oscar Levin, Pages 255-257,
265-266.