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

Applicable Analysis and Discrete Mathematics, Vol. 7, No. 2 (October 2013), pp. 262-274 (13 pages) A map f : V → {0, 1, 2} is a Roman dominating function for G if for every vertex v with f(v) = 0, ...

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