5 citations · 24 across the 13 of their papers we have counts for
4 papers · 1 filter
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…
A note on chromatic blending of colour clusters
Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil
For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, is a colour class, and , we investigate…