SKOLEM GRACEFUL SIGNED GRAPHS ON DIRECTED GRAPHS

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published May 28, 2014
P. Shalini, D. Paul Dhayabaran

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.

How to Cite

SKOLEM GRACEFUL SIGNED GRAPHS ON DIRECTED GRAPHS. (2014). Asian Journal of Current Engineering and Maths, 3(3). http://informaciontechnologica.com/index.php/ajcem/article/view/796
Abstract 158 | PDF Downloads 140

##plugins.themes.bootstrap3.article.details##

Section
Articles

How to Cite

SKOLEM GRACEFUL SIGNED GRAPHS ON DIRECTED GRAPHS. (2014). Asian Journal of Current Engineering and Maths, 3(3). http://informaciontechnologica.com/index.php/ajcem/article/view/796