K. A. Germina

activity

20102017

most citedOn Weakly Uniform Integer Additive Set-Indexers of Graphs

55 citations · 221 across the 36 of their papers we have counts for

collaborators

Showing 2013Show all

8 papers · 1 filter

math.CO2013

A Study on Arithmetic Integer Additive Set-Indexers of Graphs

N. K. Sudev, K. A. Germina

A set-indexer of a graph $G$ is an injective set-valued function $f : V (G) \to 2^{X}$ such that the function $f^{\oplus} : E (G) \to 2^{X} - {\emptyset}$ defined by $f^{\op…

math.CO2013★ 38 cited

On Integer Additive Set-Indexers of Graphs

N. K. Sudev, K. A. Germina

A set-indexer of a graph $G$ is an injective set-valued function $f : V (G) \to 2^{X}$ such that the function $f^{\oplus} : E (G) \to 2^{X} - {\emptyset}$ defined by $f^{\op…

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 $f : V (G) \to 2^{N_{0}}$ such that the induced function $g_{f} : E (G) \to 2^{N_{0}}$ 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 $f : V (G) \to 2^{N_{0}}$ such that the induced function $g_{f} : E (G) \to 2^{N_{0}}$ defi…

math.CO2013★ 7 cited

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

N. K. Sudev, K. A. Germina

Let $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^{N_{0}}$ such that the induc…

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 $f : V (G) \to 2^{N_{0}}$ such that the induced function $g_{f} : E (G) \to 2^{N_{0}}$ defi…