K. Chithra

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

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

collaborators

6 papers

math.GM2016

Certain Chromatic Sums of Some Cycle Related Graph Classes

N. K. Sudev, K. P. Chithra, Johan Kok

Let $C = {c_{1}, c_{2}, c_{3}, \dots, c_{k}}$ be a certain type of proper $k$ -colouring of a given graph $G$ and $θ (c_{i})$ denote the number of times a particular colour $c_{i}$ is…

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★ 5 cited

A Study on Set-Graphs

Johan Kok, K. P. Chithra, N. K. Sudev +1

A \textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$ . The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$ .…

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…