5 citations · 22 across the 15 of their papers we have counts for
8 papers · 1 filter
On the Rainbow Neighbourhood Number of Set-Graphs
Johan Kok, Sudev Naduvath
In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respe…
On the Fading Number of a Graph
Johan Kok, Sudev Naduvath, Eunice Gogo Mphako-Banda
The closed neighbourhood of a vertex of a graph , consisting of at least one vertex from all colour classes with respect to a proper colouring of , is called a rai…
Reflection on rainbow neighbourhood numbers of graphs
Johan Kok, Sudev Naduvath, Orville Buelban
A rainbow neighbourhood of a graph with respect to a proper colouring $\C$ of is the closed neighbourhood of a vertex in such that consists of vertice…
Rainbow Neighbourhood Equate Number of Graphs
Johan Kok, Sudev Naduvath
In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number of a graph denoted by is introduced. It is defined to be the minimum number o…
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…