K. A. Germina

most citedOn the Sparing Number of the Edge-Corona of Graphs

5 citations · 11 across the 5 of their papers we have counts for

collaborators

5 papers

math.GM2017★ 2 cited

On Certain Colouring Parameters of Mycielski Graphs of Some Graphs

K. P. Chithra, N. K. Sudev, S. Satheesh +2

Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of ve…

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★ 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 $…

math.GM2015★ 2 cited

Weak Set-Labeling Number of Certain IASL-Graphs

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

Let $N_{0}$ be the set of all non-negative integers, let $X \subset N_{0}$ and $P (X)$ be the the power set of $X$ . An integer additive set-labeling (IASL) of…