Topological Integer Additive Set-Graceful Graphs
N. K. Sudev, K. A. Germina, K. P. Chithra

TL;DR
This paper introduces and studies a new class of graph labelings called topological integer additive set-graceful labelings, combining topological and additive set-labeling concepts to explore their properties and applications.
Contribution
It defines the concept of topological integer additive set-graceful labelings and investigates their properties, expanding the theory of graph labelings with new combined constraints.
Findings
Characterization of topological IASL and IASGL graphs.
Conditions for the existence of such labelings on various graph classes.
Examples illustrating the application of these labelings.
Abstract
Let denote the set of all non-negative integers and be any subset of . Also denote the power set of by . 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 . An IASL is said to be a topological IASL (Top-IASL) if is a topology of the ground set . An IASL is said to be an integer additive set-graceful labeling (IASGL) if for the induced edge-function , . In this paper, we study certain types of IASL of a given graph , which is a topological integer additive set-labeling as well as an integer additive set-graceful labeling of .
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.
