2014/03/17 by N. K. Sudev, Sudev, N. K., K. A. Germina +1 · 2 citations
Computer Science · Engineering · Mathematics · #05C78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.CO #msc:05C78
paper · pdf · doi:10.48550/arxiv.1403.3984
11 pages, submitted to JARPM
openalex publication_date 2014/03/17 · arxiv created 2015/09/27 · arxiv updated 2015/09/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A set-labeling of a graph G is an injective function f:V(G)→ P(X), where X is a finite set and a set-indexer of G is a set-labeling such that the induced function f⊕:E(G)→ P(X)-\∅\ defined by f⊕(uv) = f(u)⊕f(v) for every uv∈ E(G) is also injective. An integer additive set-labeling is an injective function f:V(G)→ P(ℕ0), ℕ0 is the set of all non-negative integers and an integer additive set-indexer is an integer additive set-labeling such that the induced function f+:E(G) → P(ℕ0) defined by f+ (uv) = f(u)+ f(v) is also injective. In this paper, we extend the concepts of set-graceful labeling to integer additive set-labelings of graphs and provide some results on them.