output
20122026
most citedOn Weakly Uniform Integer Additive Set-Indexers of Graphs

55 citations

Showing 2014Show all

10 papers · 1 filter

math.CA2014★ 1 cited

A note on a hypergeometric transformation formula due to Slater with an application

Y. S. Kim, A. K. Rathie, R. B. Paris

In this note we state (with minor corrections) and give an alternative proof of a very general hypergeometric transformation formula due to Slater. As an application, we obtain a n…

math.CO2014★ 5 cited

Further Studies on the Sparing Number of Graphs

N K Sudev, K A Germina

Let denote the set of all non-negative integers and be its power set. An integer additive set-indexer is an injective function $f:V(G)\to…

math.CO2014★ 2 cited

The Sparing Number of the Cartesian Products of Certain Graphs

K. P. Chithra, K. A. Germina, N. K. Sudev

Let be the set of all non-negative integers. An integer additive set-indexer (IASI) is defined as an injective function …

math.CO2014★ 3 cited

A Study on the Sparing Number of the Corona of Certain Graphs

K. P. Chithra, K. A. Germina, N. K. Sudev

An integer additive set-indexer (IASI) is defined as an injective function such that the induced function $f^+:E(G) \rightarrow \mathc…

math.CO2014★ 7 cited

On Integer Additive set-Sequential Graphs

N. K. Sudev, K. A. Germina

A set-labeling of a graph is an injective function , where is a finite set of non-negative integers and a set-indexer of is a set-labeling suc…

math.CO2014★ 1 cited

The Sparing Number of Certain Graph Powers

N. K. Sudev, K. P. Chithra, K. A. Germina

An integer additive set-indexer is defined as an injective function such that the induced function defi…