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

55 citations

Showing 2013Show all

10 papers · 1 filter

math.CO2013★ 38 cited

On Integer Additive Set-Indexers of Graphs

N. K. Sudev, K. A. Germina

A set-indexer of a graph is an injective set-valued function such that the function defined by $f^{\op…

math.CV2013

An alternative proof of the extended Saalschutz summation theorem for the r+3Fr+2(1) series with applications

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

A simple proof of a new summation formula for a terminating r+3Fr+2(1) hypergeometric series, representing an extension of Saalschutz's formula for a 3F2(1) series, is given for t…

math.CO2013★ 4 cited

Weak Integer Additive Set-Indexers of Certain Graph Products

N K Sudev, K A Germina

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

math.CO2013★ 6 cited

On the Sparing Number of Certain Graph Structures

N K Sudev, K A Germina

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

math.CO2013★ 7 cited

Weak Integer Additive Set-Indexers of Certain Graph Operations

N K Sudev, K A Germina

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

math.CO2013★ 27 cited

A Characterisation of Weak Integer Additive Set-Indexers of Graphs

N K Sudev, K A Germina

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