On Mod Difference Labeling of Digraphs

Abstract

A digraph D = (V,E) is a mod, difference digraph if there exist a positive integer m and a labeling L: V → {1, 2,…, m — 1} such that (x, y) ∊ E if and only if L(y) — L(x) ≡ L(w)(mod m) for some w ∊ V. In this paper we prove that complete symmetric digraphs, unipaths and unicycles are mod difference digraphs.