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

21 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.GM2017

Some Results on the -Colouring Parameters of Graphs

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

A vertex colouring of a given graph can be considered as a random experiment. A discrete random variable , corresponding to this random experiment, can be defined as the col…

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.GM2016

Jaco-Type Graphs and Black Energy Dissipation

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

In this paper, we introduce the notion of an energy graph as a simple, directed and vertex labeled graph such that the arcs if for all distinct…

math.GM2016★ 1 cited

Certain Chromatic Sums of Some Cycle Related Graph Classes

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

Let be a certain type of proper -colouring of a given graph and denote the number of times a particular colour is…

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 of integers, write it as , consisting of a prefix (which may possibly be empty), followed by copies of a non-empty string . Th…