Rainbow neighbourhood number of graphs

J Kok, S Naduvath, MK Jamil - Proyecciones (Antofagasta), 2019 - SciELO Chile
… respect of the rainbow neighbourhood number for certain graphs. We begin the study by
stating some important results before we proceed to specific graphs. We recall that a graph G of …

Some new results on the rainbow neighbourhood number of graphs

S Naduvath, S Chandoor, SJ Kalayathankal… - … Academy Science Letters, 2019 - Springer
Rainbow neighbourhood number of the complements and products of certain fundamental
graph … paper, we investigate the rainbow neighbourhood number of certain graph classes. …

Rainbow neighbourhood equate number of graphs

J Kok, S Naduvath - arXiv preprint arXiv:1709.00261, 2017 - arxiv.org
… In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number
of a graph G denoted by ren(G) is introduced. It is defined to be the minimum number of …

[PDF][PDF] Reflection on rainbow neighbourhood numbers

J Kok, S Naduvath, O Buelban - arXiv preprint arXiv:1710.00383, 2017 - academia.edu
… the rainbow neighbourhood number of a graph G implicitly refer to a minimum number of
vertices which yield rainbow neighbourhoods in … with the rainbow neighbourhood convention. …

A note on the rainbow neighbourhood number of certain graph classes

S Naduvath, S Chandoor, SJ Kalayathankal… - … Academy Science Letters, 2019 - Springer
rainbow neighbourhood number of the graph G, denoted by \(r_\chi (G)\). In this paper, rainbow
neighbourhood number of certain graph … the rainbow neighbourhood number of a graph

Reflection on rainbow neighbourhood numbers of graphs

J Kok, S Naduvath, O Buelban - arXiv preprint arXiv:1710.00383, 2017 - arxiv.org
number. In this paper, we show that all results known … rainbow neighbourhood number of
a graph G implicitly refer to a minimum number of vertices which yield rainbow neighbourhoods

On the rainbow neighbourhood number of Mycielski type graphs

S Naduvath, C Susanth… - International Journal of …, 2018 - hal.science
… is called the rainbow neighbourhood number of the graph G, denoted by rχ(G). In this
paper, we discuss the rainbow neighbourhood number of the Mycielski type graphs of graphs. …

Rainbow matchings and rainbow connectedness

A Pokrovskiy - arXiv preprint arXiv:1504.05373, 2015 - arxiv.org
… Recall that N+(v) denotes the out-neighbourhood of a vertex v ie the set of … graph, dR(u,
v) denotes the length of the shortest rainbow path from u to v. We say that a graph has rainbow

[图书][B] Rainbow connections of graphs

X Li, Y Sun - 2012 - books.google.com
rainbow connection number of a connected graph G, denoted by rc(G), as the smallest number
of … of vertices in the triple, there is a path that does not contain any neighbor of the third. A …

Rainbow connections of graphs: A survey

X Li, Y Shi, Y Sun - Graphs and combinatorics, 2013 - Springer
rainbow connection number of a connected graph G, denoted by rc(G), is the smallest number
of … of vertices in the triple, there is a path that does not contain any neighbour of the third. A …