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

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

Graph Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...

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

MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...

Graph domination games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

1 Apply the basic principles of mathematical logic. 2 Construct and analyse mathematical proofs. 3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract ...