Topological Integer Additive Set-Sequential Graphs
Naduvath Sudev, Germina Augustine, Chithra Sudev

TL;DR
This paper introduces and studies topological integer additive set-sequential labelings (TIASSLs) of graphs, exploring conditions and properties for graphs to admit such labelings that combine topological and additive set-labeling features.
Contribution
It defines the concept of TIASSLs, combining topological and additive set-labeling, and investigates the conditions and characteristics of graphs that admit these labelings.
Findings
Characterization of graphs admitting TIASSLs
Conditions for the existence of TIASSLs in graphs
Properties of graphs with TIASSLs
Abstract
Let denote the set of all non-negative integers and be any non-empty subset of . Denote the power set of by . An integer additive set-labeling (IASL) of a graph is an injective set-valued function such that the induced function is defined by , where is the sumset of and . If the associated set-valued edge function is also injective, then such an IASL is called an integer additive set-indexer (IASI). An IASL is said to be a topological IASL (TIASL) if is a topology of the ground set . An IASL is said to be an integer additive set-sequential labeling (IASSL) if . An IASL of a given graph is said to be a topological integer additive…
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.
