A Study on the Nourishing Number of Graphs and Graph Powers
N K Sudev, K A Germina

TL;DR
This paper investigates the properties of specific graph classes and their powers that support strong integer additive set-indexers, a type of graph labeling with injective sumset functions.
Contribution
It introduces the concept of strong integer additive set-indexers and explores which graphs and their powers admit such labelings, expanding understanding of graph labelings.
Findings
Characterization of graphs admitting strong integer additive set-indexers
Conditions under which graph powers support these labelings
Identification of graph classes with this property
Abstract
An integer additive set-indexer is defined as an injective function such that the induced function defined by is also injective, where is the sumset of and . If , then is said to be a -uniform integer additive set-indexer. An integer additive set-indexer is said to be a strong integer additive set-indexer if . In this paper, we study the characteristics of certain graph classes and graph powers that admit strong integer additive set-indexers.
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.
