On Integer Additive Set-Filtered Graphs
N. K. Sudev, K. P. Chithra, K. A. Germina

TL;DR
This paper introduces and studies a new class of graph labelings called integer additive set-filtered labelings, exploring their properties and characteristics within the framework of integer additive set-labelings.
Contribution
It defines the concept of integer additive set-filtered labelings and investigates their properties, expanding the theory of integer additive set-labelings.
Findings
Characterization of integer additive set-filtered labelings
Conditions for existence of such labelings in graphs
Properties and structural features of these labelings
Abstract
Let denote the set of all non-negative integers and be its power set. An integer additive set-labeling (IASL) of a graph is an injective function such that the induced function is defined by , where is the sumset of and . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Advanced Algebra and Logic
