# Arithmetic Intger Additive Set-Idexers of Graph Operations

Source: [Arithmetic Intger Additive Set-Idexers of Graph Operations](<https://www.sota2.com/research/paper/68fa51bb1e209131ce975f05>)

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

Data updated: 2025-10-25T11:33:07.240Z

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

Published: 2014-05-27T01:23:32.000Z

## Abstract

An integer additive set-indexer is an injective function $f:V(G)\\to 2^{\\mathbb{N}\_0}$ such that the induced function $g\_f:E(G) \\to 2^{\\mathbb{N}\_0}$ defined by $g\_f (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which admits an IASI is called an IASI graph. An arithmetic integer additive set-indexer is an integer additive set-indexer $f$, under which the set-labels of all elements of a given graph $G$ are arithmetic progressions. In this paper, we discuss about admissibility of arithmetic integer additive set-indexers by certain graph operations and certain products of graphs.

## 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/1407.4822>)

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