This repository contains programming tasks and solutions from the "Discrete Mathematics" course, with a focus on Graph Theory and Recursive Relations. The primary aim is to solve advanced problems in ...

Implementation of a program in code (C language) that displays the number of steps remaining to solve the game of the towers of Hanoi, given any position /*The problem was solved by means of a code ...

This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

The course provides an introduction to selected topics in discrete mathematics; graph theory, combinatorics, final bodies and code theory. you know basic definitions and results in graph theory you ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

In this study, we propose a method for navigating the choice of treatment for stress urinary incontinence (SUI) and urgency urinary incontinence (UUI) using graph theory in discrete mathematics. Our ...