K. Chithra

activity

20142017

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

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

collaborators

Showing 2015Show all

11 papers · 1 filter

math.GM2015

A study on the curling number of graph classes

Susanth C, Sunny Joseph Kalayathankal, N. K. Sudev +2

Given a finite nonempty sequence $S$ of integers, write it as $X Y^{k}$ , consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$ . Th…

math.GM2015★ 2 cited

Some New Results on the Curling Number of Graphs

N. K. Sudev, C. Susanth, K. P. Chithra +2

Let $S = S_{1} S_{2} S_{3} \dots S_{n}$ be a finite string. Write $S$ in the form $X Y Y \dots Y = X Y^{k}$ , consisting of a prefix $X$ (which may be empty), followed by $k$ copies of a non-empty str…

math.GM2015★ 3 cited

Curling Numbers of Certain Graph Powers

Susanth C., Sunny Joseph Kalayathankal, N. K. Sudev +2

Given a finite nonempty sequence $S$ of integers, write it as $X Y^{k}$ , where $Y^{k}$ is a power of greatest exponent that is a suffix of $S$ : this $k$ is the curling number of $S$ . Th…

math.GM2015★ 2 cited

A Study on Edge-Set Graphs of Certain Graphs

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

Let $G (V, E)$ be a simple connected graph, with $∣ E ∣ = ε .$ In this paper, we define an edge-set graph $G_{G}$ constructed from the graph $G$ such that any vertex $v_{s, i}$ o…

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…