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

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

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

The study of geodetic numbers in graph theory represents a compelling fusion of abstract mathematical ideas with practical applications across network analysis, computational optimisation, and ...

A map f : V → {0, 1, 2} is a Roman dominating function on a graph G = (V, E) if for every vertex v ∈ V with f(v) = 0, there exists a vertex u, adjacent to v, such that f(u) = 2. The weight of a Roman ...

Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework, ...

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

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

Our mathematics courses introduce students to the disciplines of theoretical and applied mathematics, from theoretical courses in analysis and algebra to applied courses such as Ordinary Differential ...

P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...