8 citations · 14 across the 5 of their papers we have counts for
7 papers
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…
On J-Colorability of Certain Derived Graph Classes
Federico Fornasiero, Sudev Naduvath
A vertex of a given graph is said to be in a rainbow neighbourhood of , with respect to a proper coloring of , if the closed neighbourhood of the vertex $v…
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 Graphs
N. K. Sudev, S. Satheesh, K. P. Chithra +1
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…