SKOLEM GRACEFUL SIGNED GRAPHS ON DIRECTED GRAPHS

Cite this:
D. Paul Dhayabaran, P. S. (2014). SKOLEM GRACEFUL SIGNED GRAPHS ON DIRECTED GRAPHS. Asian Journal of Current Engineering and Maths, 3(3). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/796
© 2022 Interactive Protocols
Article Views
168
Altmetric
1
Citations
-

Abstract

In this paper, a new concept skolem graceful signed graphs on directed graphs has been introduced. A graph G(p, m, n) is a bijective function f:V(G)->{1,2,3,…..p} 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,2,3,……m} and the negative edges receive distinct labels from the set {-1,-2,-3,…….-n} is called a skolem graceful signed graphs. Moreover, some families of graphs which has skolem signed graphs are being coming under investigation.

 Special Issue

Article Metrics Graph

Content

Section

Source