On Integer Additive Set-Filtered Graphs

2015/07/07 by N. K. Sudev, Sudev, N. K., K. P. Chithra +3
Computer Science · Mathematics · #05C78 #Advanced Algebra and Logic #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #math.GM #msc:05C78

paper · pdf · doi:10.48550/arxiv.1507.02173

12 Pages, 4 figures, Submitted

arxiv created 2015/07/07 · openalex publication_date 2015/07/07 · arxiv updated 2015/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let ℕ₀ denote the set of all non-negative integers and P(ℕ₀) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective function f:V(G)→ P(ℕ₀) such that the induced function f⁺:E(G) → P(ℕ₀) is defined by f⁺ (uv) = f(u)+ f(v), where f(u)+f(v) is the sumset of f(u) and f(v). In this paper, we introduce the notion of a particular type of integer additive set-indexers called integer additive set-filtered labeling of given graphs and study their characteristics.

Related

• A Study on Integer Additive Set-Valuations of Signed Graphs
• A Study on Integer Additive Set-Graceful Graphs
• Some New Results on Integer Additive Set-Valued Signed Graphs
• On Integer Additive set-Sequential Graphs
• A Study on Prime Arithmetic Integer Additive Set-Indexers of Graphs