Variational methods on graphs extend the classical calculus of variations to discrete structures, treating vertices and edges as the domain for differential‐like operators. By associating an energy ...

Random graph theory provides a probabilistic framework for modelling and analysing networks in which connections between entities are assigned according to specified random processes. From its origins ...

Recognise two graphs as being isomorphic if there is a one-to-one relationship between the vertices of the two graphs based on, for instance, vertex degrees and adjacency matrices State the ...

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

This course is available on the MSc in Mathematics and Computation. This course is available with permission as an outside option to students on other programmes where regulations permit. This course ...