Each integral circulant graph ICG(n, D) is characterised by its order n and a set D of positive divisors of n in such a way that it has vertex set ℤ/nℤ and edge set {(a, b) : a, b ∊ ℤ/nℤ, gcd(a — b, n ...

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