Paper Title
Mod Difference Labeling of Some Cycle - Related Graphs

A digraph D = (V,E) is a mod difference digraph if there exists 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 acyclic directed Triangular Snake graphs, Friendship graphs, Wheels and Fan graphs are mod difference digraphs. Keywords – Mod Difference Digraph, Mod Difference Labeling. Mathematics Subject Classification - 05C20, 05C78