# On Weakly Uniform Integer Additive Set-Indexers of Graphs

Source: [On Weakly Uniform Integer Additive Set-Indexers of Graphs](<https://www.sota2.com/research/paper/68fa50a31e209131ce96d3ac>)

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

Data updated: 2025-10-25T10:58:30.607Z

Authors: K A. Germina, N K. Sudev

Published: 2013-10-21T08:21:10.000Z

## Abstract

Acharya introduced the notion of set-valuations of graphs as a set analogue of the number valuations of graphs. Also we have the notion of set-indexers, integer additive set-indexers and k-uniform integer additive set-indexers. In this paper, we initiate a study of the graphs which admit k-uniform integer additive set-indexers as a generalisation to the earlier studies of 1-uniform and 2-uniform integer additive set-indexers. We introduce the notion of weakly uniform integer additive set-indexers and arbitrarily uniform integer additive set-indexers based on the cardinality of the labeling sets and provide some useful results on these types of 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.5456>)

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