Some New Results on Weak Integer Additive Set-Labeling of Graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02263331
Contributor : Sudev Naduvath <>
Submitted on : Tuesday, August 6, 2019 - 4:10:12 AM
Last modification on : Wednesday, August 7, 2019 - 1:01:37 AM

File

18. Some new Results on Weak i...
Publication funded by an institution

Identifiers

Collections

Citation

Sudev Naduvath, K. Germina. Some New Results on Weak Integer Additive Set-Labeling of Graphs. International Journal of Computer Applications, Foundation of Computer Science, 2015, 128 (5), ⟨10.5120/ijca2015906514⟩. ⟨hal-02263331⟩

Share

Metrics

Record views

2

Files downloads

6