Abstract
A rainbow neighbourhood of a graph G is the closed neighbourhood N[v] of a vertex \(v \in V(G)\) which contains at least one colored vertex of each color in the chromatic coloring \({\mathscr {C}}\) of G. Let G be a graph with a chromatic coloring \({\mathscr {C}}\) defined on it. The number of vertices in G yielding rainbow neighbourhoods is called the rainbow neighbourhood number of the graph G, denoted by \(r_\chi (G)\). In this paper, rainbow neighbourhood number of certain graph classes are discussed.
References
Bondy JA, Murty USR (1976) Graph theory. Springer, Berlin
Harary F (2001) Graph theory. New Age International, New Delhi
West DB (2001) Introduction to graph theory. Pearson Education Inc, Delhi
Chartrand G, Zhang P (2009) Chromatic graph theory. CRC Press, Boca Raton
Jensen TR, Toft B (1995) Graph coloring problems. Wiley, Hoboken
Kok J, Sudev NK, Jamil MK (2017) Rainbow neighbourhood number of graphs. Proy J Math. (communicated)
Bras RL, Gomes CP, Selman B (2013) Double wheel graphs are graceful. In: Proceedings of 23rd international joint conference on artificial intelligence
Gallian JA (2015) A dynamic survey of graph labeling. Electron J Comb DS-6
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Naduvath, S., Chandoor, S., Kalayathankal, S.J. et al. A Note on the Rainbow Neighbourhood Number of Certain Graph Classes. Natl. Acad. Sci. Lett. 42, 135–138 (2019). https://doi.org/10.1007/s40009-018-0702-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40009-018-0702-6