|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 123 - Issue 2 |
| Published: August 2015 |
| Authors: N.K. Sudev, K. P. Chithra, K.A. Germina |
10.5120/ijca2015905237
|
N.K. Sudev, K. P. Chithra, K.A. Germina . Topological Integer Additive Set-Graceful Graphs. International Journal of Computer Applications. 123, 2 (August 2015), 1-4. DOI=10.5120/ijca2015905237
@article{ 10.5120/ijca2015905237,
author = { N.K. Sudev,K. P. Chithra,K.A. Germina },
title = { Topological Integer Additive Set-Graceful Graphs },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 123 },
number = { 2 },
pages = { 1-4 },
doi = { 10.5120/ijca2015905237 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A N.K. Sudev
%A K. P. Chithra
%A K.A. Germina
%T Topological Integer Additive Set-Graceful Graphs%T
%J International Journal of Computer Applications
%V 123
%N 2
%P 1-4
%R 10.5120/ijca2015905237
%I Foundation of Computer Science (FCS), NY, USA
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(X) such that the induced function f+ : E(G) ! P(X) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IASL) if f(V (G)) [ f;g is a topology of the ground set X. An IASL is said to be an integer additive set-graceful labeling (IASGL) if for the induced edgefunction f+, f+(E(G)) = P(X)??f;; f0gg. In this paper, we study certain types of IASL of a given graph G, which is a topological integer additive set-labeling as well as an integer additive set-graceful labeling of G.