• GENERALIZATION OF SKOLEM EVEN GRACEFUL DIGRAPHS FOR VARIOUS GRAPHS

Abstract

In this paper, the new concept Skolem Even Graceful Labelings on directed graphs has been introduced and a formula for skolem even graceful labeling in digraphs has been established.  A function q is called an Skolem even graceful labelings of a graph G with q edges. If q is a bijective function from the vertices of G to the set {1, 2, 3. . . 2q} such that when each edge uv is assigned the label q(uv) =[q(v) - q(u)][mod(2q + 2)], then the resulting edge labels are distinct even numbers, ranges from 2 to 2q. Moreover, some families of graphs which are coming under skolem even graceful digraphs are being investigated.