|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 128 - Issue 5 |
| Published: October 2015 |
| Authors: N.K. Sudev, K.A. Germina |
10.5120/ijca2015906514
|
N.K. Sudev, K.A. Germina . Some New Results on Weak Integer Additive Set-Labeling of Graphs. International Journal of Computer Applications. 128, 5 (October 2015), 1-5. DOI=10.5120/ijca2015906514
@article{ 10.5120/ijca2015906514,
author = { N.K. Sudev,K.A. Germina },
title = { Some New Results on Weak Integer Additive Set-Labeling of Graphs },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 128 },
number = { 5 },
pages = { 1-5 },
doi = { 10.5120/ijca2015906514 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A N.K. Sudev
%A K.A. Germina
%T Some New Results on Weak Integer Additive Set-Labeling of Graphs%T
%J International Journal of Computer Applications
%V 128
%N 5
%P 1-5
%R 10.5120/ijca2015906514
%I Foundation of Computer Science (FCS), NY, USA
Let ℕ0 denote the set of all non-negative integers and P(ℕ0) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) → P(ℕ0) such that the induced function f+ : E(G) → P(ℕ0) 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 an integer additive set-indexer (IASI) if the associated edge-function f+ is also injective. An IASL f of a given graph G is said to be a weak integer additive set-labeling (WIASL) of G if the cardinality of the set-label of every edge of G is equal to the cardinality of the set-label of at least one end vertex of it. In this paper, we study the admissibility of weak integer additive set-labeling by different graphs.