Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015
The Exquisite Integer Additive Set-Labeling of Graphs
N. K. Sudev | K. A. Germina
Abstract: Let N_0 denote the set of all non-negative integers and P (N_0) be its power set. An integer additive set-indexer (IASI) of a graph G is an injective function fV (G) -P (N_0) such that the induced function f^+E (G) -P (N_0) defined by f^+ (uv) =f (u) +f (v) is also injective, where f (u) +f (v) is the sum set of f (u) and f (v). If f^+ (uv) =k - uv-E (G), then f is said to be a k-uniform integer additive set-indexer. In this paper, we study the admissibility of a particular type of integer additive set-indexers by certain graphs.
Keywords: Integer additive set-labeling, integer additive set-indexers, weak integer additive set-labeling, strong integer additive set-labeling, exquisite integer additive set-labeling
Edition: Volume 4 Issue 4, April 2015,
Pages: 2858 - 2862
How to Cite this Article?
N. K. Sudev, K. A. Germina, "The Exquisite Integer Additive Set-Labeling of Graphs", International Journal of Science and Research (IJSR), Volume 4 Issue 4, April 2015, pp. 2858-2862, https://www.ijsr.net/get_abstract.php?paper_id=SUB153911
How to Share this Article?
Similar Articles with Keyword 'Integer'
Integer Linear Programming Applied to Nurses Rostering Problem
A. A. Maidamisa | H. A. Odiniya 
The Beal's Conjecture and Fermat's Last Theorem