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

37 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 according to certain conditions can be considered as a random experiment and a discrete random variable can be defined as the number of ve…

math.GM2016

Some New Results on Integer Additive Set-Valued Signed Graphs

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

Let denotes a set of non-negative integers and be its power set. An integer additive set-labeling (IASL) of a graph is an injective set-valued function $f:…

math.GM2016

On the Vertex In-Degrees of Certain Jaco-Type Graphs

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

The concepts of linear Jaco graphs and Jaco-type graphs have been introduced as certain types of directed graphs with specifically defined adjacency conditions. The distinct differ…

math.GM2015

A Note on Sparing Number Algorithm of Graphs

N. K. Sudev, K. A. Germina

Let 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 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 denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph 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 denote the set of all non-negative integers and be its power set. An integer additive set-labeling (IASL) of a graph is an inject…