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 ...

Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

Domain Specific Language for discrete mathematics - graph theory - Dijkstra's algorithm in F#. The main gist of this project is to find the shortest path between two vertices based on the weight of ...

http://dx.doi.org/10.1016/j.disc.2010.04.009 ...

Abstract: This work investigates the continuous-state counterpart of the discrete randomized shortest-path framework (RSP, [23]) on a graph. Given a weighted directed graph G, the RSP considers the ...

ABSTRACT: An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least ...

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 ...

This course is available on the BSc in Business Mathematics and Statistics, BSc in Mathematics and Economics, BSc in Mathematics with Economics and BSc in Mathematics, Statistics and Business. This ...