55 citations · 242 across the 60 of their papers we have counts for
62 papers
A Note on -Colouring of Jahangir Graphs
Johan Kok, Sudev Naduvath
In this paper, we discuss -colouring of the family of Jahangir graphs. Note that the family of Jahangir graphs is a wide-ranging family of graphs which by a generalised definiti…
On Chromatic Curling Number of Graphs
C. Susanth, N. K. Sudev, S. J. Kalayathankal
The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or…
On Equitable Coloring Parameters of Certain Cycle Related Graphs
K. P. Chithra, E. A. Shiny, N. K. Sudev
Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment and corresponding to this experiment, a discrete random variable X can be de…
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…
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…
Rainbow Neighbourhoods of Graphs
Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil
In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph . We report on preliminary…