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

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

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

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

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

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

D. Fan, S. Goryainov, X. Huang, H. Lin, The spanning k-trees, perfect matchings and spectral radius of graphs, Linear Multilinear Algebra 70 (2022), 7264–7275. P ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Jason Williford joined the University of Wyoming faculty in 2009. He came to the University of Wyoming from the University of Colorado at Denver. His mathematical interests center around the interplay ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...