Explore UCD

UCD Home >

MATH20150

Academic Year 2026/2027

Graphs and Networks (MATH20150)

Subject:
Mathematics
College:
Science
School:
Mathematics & Statistics
Level:
2 (Intermediate)
Credits:
5
Module Coordinator:
Dr Vincent Astier
Trimester:
Autumn
Mode of Delivery:
Blended
Internship Module:
No
How will I be graded?
Letter grades

Curricular information is subject to change.

This course covers basic concepts and results in graph theory and the theory of network flows that are needed in various fields of Discrete Mathematics and Computer Science.

About this Module

Learning Outcomes:

After successful completion of the course, a student should:1. be able to determine whether or not certain sequences belong to simple graphs;2. be able to construct a graph, given a graphic sequence;3. be able to perform simple mutations of a graph, such as constructing its subgraphs, its complement and its dual where one exists;4. know basic results about acyclic graphs (trees)5. be able to compute minimal weight spanning trees (Prim & Kruskal algorithms);6. be able to identify Eulerian graphs and find Euler circuits;7. know some necessary and sufficient conditions for a graph to be Hamiltonian and be able to apply these to arbitrary graphs;8. be familar with Euler's polyhedral formula and apply it to establish non-planarity;9. be able to determine isomorphisms for small graphs;10. be familiar with the min-cut max flow theorem;11. be able to apply the Ford-Fulkersen algorithm for the construction of a maximal flow.

The United Nations identified seventeen Sustainable Development Goals (SDGs) as core to the 2030 Agenda for Sustainable Development, and UCD contributes in general to SDG 4 Quality Education. Further SDGs explored within this module if relevant are listed below. A scale of 1 - 5 indicates the extent to which the SDG is covered.


 

Student Effort Hours:
Student Effort Type Hours
Specified Learning Activities

24

Autonomous Student Learning

50

Lectures

18

Tutorial

12

Total

104


Approaches to Teaching and Learning:
Lectures, tutorials, enquiry and problem-based learning.

Requirements, Exclusions and Recommendations
Learning Requirements:

Basic Discrete Mathematics and Combinatorics


Module Requisites and Incompatibles
Equivalents:
Graphs and Networks (MATH27150)


 

Assessment Strategy
Description Timing Component Scale Must Pass Component % of Final Grade Component repeat (in-module) Offered
Exam (In-person): End of trimester exam End of trimester
Duration:
2 hr(s)
Standard conversion grade scale 40% No
70
No
Exam (In-person): Midterm exam. Probably on week 8, during the Tuesday or Thursday slot (to be determined), but could be moved by one week. Week 8 Standard conversion grade scale 40% No
30
No

As part of UCD's student support, under the Additional Consideration policy, extensions may be available for the following assessments in the module: Assignment (including essay/poster), Portfolio, Reflective Assignment, Report(s), and Individual Project.


Carry forward of passed components
No
 

Resit In Terminal Exam
Spring Yes - 2 Hour
Please see Student Jargon Buster for more information about remediation types and timing. 

Feedback Strategy/Strategies

• Group/class feedback, post-assessment

How will my Feedback be Delivered?

Not yet recorded.

Name Role
Mr Cian Boland Tutor

Timetabling information is displayed only for guidance purposes, relates to the current Academic Year only and is subject to change.
Autumn Lecture Offering 1 Week(s) - Autumn: All Weeks Tues 16:00 - 16:50
Autumn Tutorial Offering 1 Week(s) - Autumn: Weeks 2-12 Mon 13:00 - 13:50
Autumn Tutorial Offering 2 Week(s) - Autumn: Weeks 2-12 Wed 11:00 - 11:50