# Some New Results on Strong Integer Additive Set-Indexers of Graphs

Source: [Some New Results on Strong Integer Additive Set-Indexers of Graphs](<https://www.sota2.com/research/paper/68fa513c1e209131ce971ecb>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:17:29.523Z

Authors: N. K. Sudev, K. A. Germina

Published: 2013-10-23T15:57:41.000Z

## Abstract

Let $\\mathbb{N}\_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\\to 2^{\\mathbb{N}\_0}$ such that the induced function $g\_f:E(G) \\rightarrow 2^{\\mathbb{N}\_0}$ defined by $f^+(uv) = f(u)+ f(v)$ is also injective. An IASI is said to be {\\em $k$-uniform} if $\|f^+(e)\| = k$ for all $e\\in E(G)$. In this paper, we introduce the notions of strong integer additive set-indexers and initiate a study of the graphs which admit strong integer additive set-indexers.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1310.6266>)

[PDF](<https://arxiv.org/pdf/1310.6266.pdf>)