A digraph G (p,q) is edge odd graceful if there is a bijection f : E(G) → {1,3,5,…,2q-1} such that when each vertex is assigned the sum of the labels of its outgoing arcs mod 2q, the resulting vertex labels are distinct. A digraph G (p,q) is said to be line graceful if the outgoing arcs of every vertex are labeled 0,1,2,…p-1 then the resulting vertex label is the sum of the labels of the outgoing arcs of the vertex modulo p and is distinct for every vertex. Let k ≥ 2. A digraph G(p,q) is called Mod(k)edge magic if there is an edge labeling f: E → {1,2,…,q} such that for each vertex v the sum of the labels of the outgoing arcs of v are equal to the same constant modulo k. In this paper we show that the Cayley digraphs are edge odd graceful, line graceful and mod (k)edge magic.
Abstract-In this paper we prove that regular digraphs are Edge product Cordial and Total magic cordial. A digraph G is said to have edge product cordial labeling if there exists a mapping, f:E(G)→{0,1} and induced vertex labeling function f* :V(G)→{0,1} such that for any vertex vi V(G), f* (vi) is the product of the labels of outgoing edges provided the condition │v (0)
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.