Associate Professor, PG and Research Department of Mathematics, Cauvery College for Women (Autonomous)
In this article, the new concept skolem odd vertex graceful signed graphs on directed graphs have been introduced. A graph G(P, m, n) is a bijective function f:V(G) {1, 3, 5, 7, …, 2p-1} such that, when each edge uv E(G) is assigned by f(uv) = f(v) -f(u) the positive edges receive distinct labels from the set {1, 3, 5, …, 2m-1} and the negative edges receive distinct labels from the set {-1, -3, -5, -6, ..., -2n-1}, it is called as a skolem odd vertex graceful signed graphs. In this article, Path graph is investigated under skolem odd vertex graceful labeling for signed graph.
Graceful Labeling, Signed Graphs, Additive Labeling, Skolem edge graceful labeling
