ON THE RAINBOW NEIGHBOURHOOD NUMBER
OF MYCIELSKI TYPE GRAPHS
N.K. Sudev1, C. Susanth2, S.J. Kalayathankal3 1Department of Mathematics
CHRIST (Deemed to be University)
Bengaluru - 560029, INDIA 2 Department of Mathematics
Vidya Academy of Science & Technology
Thalakkottukara, Thrissur - 680501, INDIA 3 Department of Mathematics
Kuriakose Elias College
Mannanam, Kottayam - 686561, INDIA
A rainbow neighbourhood of a graph is the closed neighbourhood of a vertex which contains at least one colored vertex of each color in the chromatic coloring of . Let be a graph with a chromatic coloring defined on it. The number of vertices in yielding rainbow neighbourhoods is called the rainbow neighbourhood number of the graph , denoted by . In this paper, we discuss the rainbow neighbourhood number of the Mycielski type graphs of graphs.
You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.
References
[1] G. Chartrand and P. Zhang, Chromatic Graph Theory, CRC Press, Boca Raton (2009).
[2] F. Harary, Graph Theory, New Age International, New Delhi (2001).
[3] T.R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons (1995).
[4] J. Kok, N.K. Sudev, M.K. Jamil, Rainbow neighbourhoods of graphs, Proy. J. Math., (2018), In Press.
[5] W. Lin, J. Wu, P.C.B. Lam, G. Gu, Several parameters of generalized Mycielskians, Discrete Appl. Math., 154, No 8 (2006), 1173-1182; DOI:10.1016/j.dam.2005.11.001.
[6] N.K. Sudev, C. Susanth, S.J. Kalayathankal, J. Kok, A note on the rainbow neighbourhood number of graphs, Nat. Acd. Sci. Lett., Online First (2018); DOI: 10.1007/s40009-018-0702-6.
[7] N.K. Sudev, C. Susanth, S.J. Kalayathankal, J. Kok, Some new results on the rainbow neighbourhood number of graphs, Nat. Acd. Sci. Lett., Online First (2018); DOI: 10.1007/s40009-018-0740-0.