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 2015Show all

7 papers · 1 filter

math.GM2015

A Note on Sparing Number Algorithm of Graphs

N. K. Sudev, K. A. Germina

Let $X$ denote a set of all non-negative integers and $\sP(X)$ be its power set. A weak integer additive set-labeling (WIASL) of a graph $G$ is an injective set-valued function $f:…

math.GM2015

A Study on Integer Additive Set-Valuations of Signed Graphs

N. K. Sudev, K. A. Germina

Let $N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V…

math.GM2015

On Integer Additive Set-Filtered Graphs

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

Let $N_{0}$ denote the set of all non-negative integers and $P (N_{0})$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an inject…

math.GM2015★ 1 cited

Topological Integer Additive Set-Graceful Graphs

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

Let $N_{0}$ denote the set of all non-negative integers and $X$ be any subset of $X$ . Also denote the power set of $X$ by $P (X)$ . An integer additive set-labeling…

math.GM2015★ 5 cited

On the Sparing Number of the Edge-Corona of Graphs

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

Let $N_{0}$ be the set of all non-negative integers and $P (N_{0})$ be its the power set. An integer additive set-indexer (IASI) of a graph $G$ is an injecti…

math.GM2015★ 2 cited

Strong Integer Additive Set-valued Graphs: A Creative Review

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

For a non-empty ground set $X$ , finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f : V (G) \to P (X)$ , where $…